Search and Sorting

Search 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

   • The number will be put into order. Once they're in order it will count how many cards there are starting with 0 then half it until it finds the number.
   • Binary search is an efficient algorithm for finding an item from a sorted list of items.

3. Bubble Sort

   • The algorithm starts at the beginning of the data set. It compares the first two value, and if the first is greater than the second, it swaps them.
   • It continues doing this for each pair of adjacent values to the end of the data set. It then starts again with the first two elements, repeating until no swaps have occurred on the last pass

4. Merge Sort

   • Splits sub-list in two until you reach pair of values
   • Sort/Swap pair of values if needed
   • Merge and sort sub-lists and repeats process until you merge to the full list

5. Insertion Sort

   • An insertion sort compares values in turn, starting with the second value in the list. If this value is greater than the value to the left of it, no changes are made.
   • Otherwise this value is repeatedly moved left until it meets a value that is less than it. The sort process then starts again with the next value.