searching and sorting

searching and sorting

1. sorting

   • merge
   • bobble
   • insersion

2. searching

   • binary
     • Start by setting the counter to the middle person on the list If the value held there is a match ,the search ends. If the value at the midpoint is less than the value to be found, the list is divided in half. The lower half of the list is ignored and the search keeps to the upper half of the list Otherwise, if the value at the midpoint is greater than the value to be found, the upper half of the list is ignored and the search keeps to the lower half of the list If you can't find the value than its not in the list By starting the middle number you have to then see if the number is bigger or smaller than you need if its smaller you take away the smaller digest away from the group of number and the same if they are bigger. You repeat the same process until you get your answer. Once a list of numbers are in order, a binary search can be run on the data. Describe the steps a binary search will follow to look for a number in a softed list.
   • linear
     • Each item in a list is checked in order from the start of the list until the item is found. A liner search allows us to search for values even if the values are not in order