Sorting Algorithms

Sorting Algorithms

1. Bubble Sort

   • This is a simple algorithm that works well when applied to smaller data sets.
   • It works by camparing two adjacent valuesin the data set and swapping them if necessary. It compares the first with the second, then the secon dwith the thrid, the the third with the fourth and so on.
   • Disadvantages
     • Unsuitable for large data sets, which take a long time to sort using a bubble sort.
     • Processor time is used ineficiently, as some data items are examined multiple times
   • Advantages
     • Hardly any exrta memory is needed to temporarily hold data during sorts.
     • Very few lines of code required, so esier to program

2. Quick Sort

   • Advantages
     • More efficient, therefore faster, tman the bubble sort
   • Disadvantages
     • Loses its efficiency if sorting data that is almost in order, or in reverse order.
     • The code to implement quicksort is more difficult to understand and implement than bubble sort

3. Selection Sort

   • Advantages and Disadvantages
     • same as bubble sort
   • The algorithm breaks a collection into two parts - a sorted part and a unsorted part (the sorted part is initially empty). During each pass, the smallest number from the unsorted part is placed at the rightmost edge of the sorted part.

Bilder und Dateien der Mindmap