Binary Search and Recursion

(Without recursion, get zero credit)

- Create a file of at least 20 student records sorted by student ID.

- Read student records into a vector in C++ or Java program. (For Vector, refer to Chapter 7.11)

- Student records should include Student ID, Name, GPA, Student Address, and

a pointer which points to (10+) test scores for each student record located somewhere in the program or from a second file.

- Display the 20+ student records (entire record, not just ID) and associated test scores.

- Use recursive binary search to search three-five student-IDs in the vector.

- Use recursive binary search to search a student-ID at the end

of the vector.

- Use recursive binary search to search a student-ID which is not in the vector.

For each search, print the ID to be searched and the searched result with

the found entire record.

For each search, also count the number of times the recursive binary search function has gone thru the recursion cycle. And print the count for each search.

Your program output must show proper information to be understood well

by the reader/viewer.