trace sort algorithms

trace sort algorithms

1. Merge sort

   • This is much more efficient than the bubble sort and insertion sort
     • Divide the unsorted list into n sublists then merge the pairs of sublists into a single a sorted list. Sorting each time a sublist joins

2. Insertion sort

   • This algorithm sorts one data item at a time. One item is taken from the list, and placed in the correct position relative to the ones already sorted.

3. Bubble sort

   • Each item in a list is compared to the one next to it, and if it is greater, they swap places This is repeated until the items are sorted.

4. Merging two sorted lists

   • Read item from list A; Read item from list B. Write smaller to output list, leave larger. Repeat for next numbers