Unit 2.1-Algorithms

Unit 2.1-Algorithms

1. Binary Search

   • ordered list divided in 2 with each comparison
   • List needs to be in order
   • Take middle value
     • Compare to value you are looking for

2. Linear Search

   • Unsorted- items checked in order

3. Bubble Sort

   • Move repeatedly through list
   • Swapping elements that are in wrong order

4. Insertion Sort

   • One value checked at a time
   • Swap if needed. Else is kept on same place
   • Goes through list once

5. Merge Sort

   • List divided in two
   • Each list divided again
   • Lists are sorted and joined together
   • Two lists are sorted and reunited.