SEARCHING AND SORTING

SEARCHING AND SORTING

1. LINEAR

   • linear searching is when each item in a list is checked in order from the start of the list until the item is found
   • a linear search allows us to search for values even if the value are not in order
   • linear search is easy to implement

2. binary

   • It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one.
   • its difficult to implement correctly
   • the values must already be in order for the binary search to work

3. merge sort

4. bubble sort

   • a simple sorting algorithm that starts at the beginning of a dataset and checks values in 'pairs' and swaps them if they are not in the correct order
   • its simple but slow

5. insertion sort