2.1 searching and sorting algorithms

2.1 searching and sorting algorithms

1. binary search

   • the algorithm
     • calculate a mid point in the data set
       • check if that is the item to be found
         • if not....
           • if the item to be found is lower than the mid point repeat on the left half of the data set.
             • if the item to be found is greater than the mid point repeat on the right

2. linear search

   • the algorithm
     • starting from the beginning of a data set each item is checked in turn to see if it is the one being searched for.
   • requirements/ efficiency
     • doesn't require the data set to be in order
       • will work on any type of storage device

3. bubble sort

   • the algorithm
     • sorts an unordered list of items
       • it compares each item with the next one and swaps them if they are out of order.