Lists (Array)

Lists (Array)

1. Sorting Algorithms

   • Insertion Sort
     • Takes each item in turn and puts it in the right order using the first item in the list as a stating point.
   • Bubble Sort
     • Compares pairs of items.
     • Use to sort an unordered list of items.
     • Often simple but may take a while to actually sort a list.
   • Merge
     • Splits the list apart and merges it back together.
     • Disadvantages
       • It's slower than other algorithms for small lists.
     • Advatages
       • It's generally much more efficient and quicker than Bubble and Insertion sort algorithms.