searching and sorting

searching and sorting

1. linear search

   • 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 values are not in order

2. binary search

3. insertion sort

   • The list is logically split sorted values (on the left) and unsorted values.
   • Starting from the left, values from the unsorted part checked inserted at the correct position. ​ This continues through all elements of the list.

4. merge sort

5. 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
   • One full run of comparisons from beginning to end is called a 'pass', a bubble sort may require multiple 'passes' to sort the dataset.