Sorting Algorithms

Sorting Algorithms

1. Bubble sort

   • Advantages
     • Hardly any extra memory is needed to temporarily hold data during sorts
     • Very few lines of code required, so easier to program
   • Disadvantages
     • Unsuitable for large data sets, which take a long time to sort using a bubble sort
     • Processor time is used inefficiently, as some data items are examined multiple times
   • Explanation
     • It works by comparing two adjacent values in the data set and swapping them when necessary.
       • When it is done with one number it has done one pass and keeps doing these passes until the numbers are sorted

2. Quick Sort

   • Advantages
     • More efficient, there faster, than 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
   • Explanation
     • Identify a pivot, usually in the middle of the data set
       • Re order the data so that all data items smaller than the pivot apprear before
         • Perform the same sort on the different sets of data using different pivot points

3. Selection Sort

   • Disadvantages
   • Advantages
   • Breaks the list into a sorted and unsorted list (sorted list is usually empty)
     • This algorithm breaks a collection into two parts- a sorted part(usually empty) and an unsorted part.
       • 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