**Sorting**
In order to do a binary search we need to have the collection of data sorted.  To learn about the different algorithms we will not use the java libraries or sorting.  The first method will be a [[http://www.youtube.com/watch?v=P00xJgWzz2c|bubble sort]], so inefficient that it is not even tested on the AP exam.  It does provide a way to compare the efficiency of the algorithmsthat are on the Exam.  Here is a link to a Google interview with [[http://www.youtube.com/watch?v=HAY4TKIvSZE|Obama when he was first running for President]].  
  - [[https://www.youtube.com/watch?v=lCDZ0IprFw4|Insertion Sort]]
  - [[https://www.youtube.com/watch?v=cqh8nQwuKNE&list=RDCMUC4Xt-DUAapAtkfaWWkv4OAw&index=2|Selection Sort]]
  - [[https://www.youtube.com/watch?v=iMT7gTPpaqw&list=RDCMUC4Xt-DUAapAtkfaWWkv4OAw&index=3|Merge Sort]]
  - [[https://www.youtube.com/watch?v=yv6svAfoYik|Coding a Recursive Merge Sort]]
  - [[https://www.youtube.com/watch?v=5o-kdjv7FD0|Coding Interview Step Problem]]