Sorting and Searching Algorithms

Assume the list is not sorted (sorted is set to FALSE)
while(!sorted)
{
   Assume the list is sorted (sorted is set to TRUE)
   Set i to loop through list from first to last - 1
   {
      if list[i] and list[i + 1] are not in the right order
      {
         switch them (called a swap)
         set sorted to FALSE
      }
   }
}

• The algorithm for a binary search is to look at the element that is in the middle of the list.
  
  
• If it matches the item you are searching for, you have found it.
  
  
• If it doesn't match, take whatever half the element is in, and locate the item in the middle and compare it to what you are searching for.
  
  
• Keep doing this until you have found it, or until there are no more elements in the "half" you are looking at.
  
  
• To use a binary search, the following conditions are required:
  
  
  1. The list must be sorted.
     
     
  2. The program must know if the list is sorted in ascending (smallest to biggest) or descending (biggest to smallest) order.
     
     
  3. The program must know how many items are in the list.