Problem
1. Implement a sequential searching algorithm which averages about N/2 steps for both successful and unsuccessful search, keeping the records in a sorted array.
2. Give the order of the keys after records with the keys E A S Y Q U E S T I 0 N have been put into an initially empty table with search and insert using the self-organizing search heuristic.
3. Give a recursive implementation of binary search.