Bubble Sort

Bubble Sort

1. How it works?

   • You need to look at the first two items , if they in right order , we don't do anything, if they in wrong order, swap them, move to the next pair and repeat previous steps. Until you get to the end of the list, it calls pass. Until steps again until the are no swaps

2. Cons

   • It's a simple algorithm. It's an efficient way to check if a list is already in order. Doesn't use very much memory.

3. Pros

   • It's an inefficient way to sort a list - for a list of n items , the worst case scenario. Does not cope well with a large list of items.

4. Insertion Sort

   • How it works?
     • Look at the second item on the list. Compare it to all items before it. And insert number into right place. Repeat this until last item has been inserted into the correct place