2.1

2.1

1. Searching Algorithms

   • Linear Search

2. Searching Algoritms

   • Linear Search
     • Checks every item and compares it to the search criteria
     • Starts with first item, then goes to the next, then the next, then the next, etc.
     • Simple to code
     • Perfect for short lists
     • Data doesn't need to be ordered
   • Binary Search
     • Good for long lists
       • A list of 1000 items would take a maximum of 8 loops, while a linear search would take a maximum of 1000 comparisons
     • Only works on an ordered list
     • Splits the list in two and checks which half the search criteria would be in

3. Sorting Algoritms

   • Bubble sort
     • Compares one item to a previoius item
     • Repeats till no swaps are made
   • Merge sort
     • Splits up all the data
     • Sorts together in pairs
   • Insertion sort
     • Item compared with all previous items