Insertion Sort

Insertion Sort

1. simple comparison sort, where the sorted list is built up one item at a time-It is more efficient faster than bubble sort

2. if there is only one item in the list then stop.

   • start with second item and compare it with the first
     • when a smaller number is found, place the item in the position to the right of it by moving all the other numbers along
       • repeat until the end of the list is reached and all the numbers are in the correct order

3. advantages

   • simplier to code than a merge sort
     • useful for small lists that take a very short times to sort
       • faster to prcoscess a small list than using a bubble sort

4. disadvantages

   • not efficient with large lists- merge sort would be a better choice

Bilder und Dateien der Mindmap