Linear Search

• checks each item of the list to see if its the right one
• stops when it either finds the item it was looking for, or has checked every item
• 1. look at the first item in the unordered list
  2. stop if this is the right item
  3. if not, look at the next item
  4. repeat until you've found it or have looked at every item
• much simpler than binary search but not as efficient
• can be used on any type of list, it doesn't have to be ordered
• due to inefficiency, it is only used on small lists
• once the list has been ordered, a binary search is much more efficient than a linear search