Problem 3-6 Seek

In Seek you will have the opportunity to put together all that you learned in unit 3! You will use your random number generator (RNG) to generate unsorted numbers, implement a linear search algorithm to search for a number, and then finally implement one of the sorting algorithms you coded in Sort Race to sort your random numbers and re-implement search using the divide and conquer strategy known as binary search.

http://cdn.cs50.net/ap/1516/problems/3/6/3-6.html