Bubble and Insertion sort

Bubble and Insertion sort

1. Bubble sort

   • Starts by comparing the first two elements of an array and swapping if necessary, from lowest to highest as an example.
     • Therefore if the first element is larger than the second, you will need to switch them.
     • Once it has completed the first comparison, it will move onto comparing the second and third element and repeating the process.
       • Once it has been compared from left to right, it may need to go through the loop again as some elements will still be displaced.
   • It goes through the whole array from left to right and repeats this process until all the elements are in the correct position.

2. Insertion sort

   • Insertion sort starts off by looking at the first two elements and comparing them to decide whether to move them or keep them in the same place; depending on if it is lowest to highest or not.
     • After the first two are compared, then the third element is selected and goes through all the elements to the left of it to decide where it will go.
       • For example, if you have the number 1 in the third position, then 12 in the second and 3 in the first. You would go past 12 as it is smaller, then past 3 as it is also smaller. Therefore would be in the correct position without having to go through the loop multiple times it goes through only once.
   • Only needs to do one loop to complete the process

Bilder und Dateien der Mindmap