2.1.3 Searching and Sorting Algorithms JS

2.1.3 Searching and Sorting Algorithms JS

1. Binary Search

   • Find the middle item in an ordered list
     • If this is the item you were looking for then stop the search as you've found it
     • If not compare the item you were looking for to the middle item
       • If it comes before the middle item get rid of the second half of the list
       • If it comes after the middle item get rid of the first half of the list
         • you'll be left with a list that is half the size of the original list
           • Repeat the previous steps and you will get an even smaller list of data
             • Keep going until you find the item you are looking for
   • Binary search uses the formula: Midpoint = (First + Last) Div 2. It does this to calculate the midpont

2. Linear Search

   • Look at the first item in an unordered list
     • (It can be used on an unordered
     • If this is the item you were looking for then stop the search as you have found it
     • Repeat the previous steps on each individual item until you have found the item you want

3. Bubble Sort

4. Merge Sort

5. Insertion Sort