algorithms

algorithms

1. linear search

   • the simplest method of searching a data set
     • examines every item in the data set until a match is found
   • works on any data set if it is ordered or unordered

2. binary search

   • only works on ordered data
   • efficient
   • start with the midpoint
     • if midpoint > value to be found the upper half of the list is ignored
     • if midpoint< value to found the lower half of the list is ignored

3. merge sort

   • complex but efficient
   • splits data into individual elements
     • compares them as pairs and orders them
       • if the number on the left is smaller than the one the right it is placed into order

4. insertion sort

   • starts with the second of the value
     • if it is greater than the value to the left no changes are made
       • if not it moved repeatedly to the left until there is a value less than it
     • this process repeats with the next value