SORTS

SORTS

1. Bubble sort

   • Bubble sort is considered the simplest sorting algorithm. It goes through an entire array and compares each neighboring number. It then swaps the numbers and keeps doing this until the list is in ascending order.
     • Is the next number bigger than the current? If 'yes' then swap! If 'no' then don't.

2. Quick sort

3. Insertion sort

   • Insertion sort involves going through a pile, taking one item, comparing it to the first, swapping places if one item is larger than another and continuing this process until the minimum item is in the correct location.