Searching and Sorting

Searching and Sorting

1. Bubble Sort

   • Bubble sort repeatedly compares 2 items continuously until the array is in order

2. Insertion Sort

   • Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list.

3. Merge Sort

   • Merge sort splits down the items in an array until they are in 2s, The Merge sort will Swap the 2s into correct order, after this the sort will reorganise the items back into 4s and reorder them, the sort will repeat this until the sort is back in the correct order

4. Linear Search

   • Each item in a list is checked in order from the start of the list until the item is found
   • List does not have to be sorted to work
   • Less efficient for longer lists
   • More efficient for shorter lists

5. Binary Search

   • The Sorted array will be repeatedly halfed until the intended item is found in the array
   • List must be already sorted in order for the sort to work
   • More efficient for long lists
   • Less efficent for short list