sorting algorithms

sorting algorithms

1. bubble sort

   • it works well on small sets of data.
   • it works by comparing two adjacent values in the data set and swapping if necessary. It does this on muiltiple passes.
   • it is inefficent so it is bad to use on large sets of data

2. Quick sort

   • it works by dividing the data into incrementaly smaller and smaller subsets until the data you are looking at is either easy to sort or does not need sorting.
   • very efficient and good for larrge sets of data
   • it's very complex

3. selection sort

   • it breaks the data into two part sorted (initally empty) and unsorted. During each pass, it find the smallest number and puts it into the the sorted list and does it again untill there are none left in the unsorted list.
   • it works well on small sets of data.
   • it is inefficent so it is bad to use on large sets of data

Bilder und Dateien der Mindmap