Unit 2.1 Algorithms

Unit 2.1 Algorithms

1. Bubble Sort

   • Checking two values and if they're in the wrong order they change and it's repeated until they are
   • Moving constantly through a list

2. Merge Sort

   • List is halved
   • List is sorted and put back together

3. Binary Search

   • List needs to be ordered
   • Take the bigger half of the list and half it
   • If its in the list finish
   • If it's not take the smaller half and do the same

4. Linear Search

   • Sort out two at a time
   • Lowest To Highest

5. Insertion Sort

   • Only goes through the list once
   • One value is looked at at a time
   • If it doesn't need swapping keep it where it is