CS2308

Programming Project 1: The Searching Techniques

Reference:

Good program examples 8-1, 8-2 and 8-3 (Searching)

And study sections 8.1, and 8.2.

a. Create three array of 12+ students records including IDs, student names, and

the corresponding e-mail address, student IDs are sorted in order. (No sort program needed for now.)

b. Sequential Search five IDs which are from the sorted array and a 6th ID which is not from the array.

c. Binary Search five IDs which are from the sorted array and a 6th ID which is not from the array.

d. Execution and output:

1. Display the original sorted array of student records.

2. Display the sequential search result of student records.

3. Display the binary search result of student records.

e. Turn in source programs and the outputs in item (d)

f. The following should apply to all assignments during the semester.

Turn in with hard copy in class only and must be professional and the turn in should include the source Program, and the displayed outputs as described above. Proper messages in the output are required to indicate the execution and different outputs. Turn in all assignments in class. It will have late penalty 10% if your turn-in 30 minutes after class begins and before the class of next assignment due day.

g. Anything not mentioned in this assignment, you are free to do whatever you desire. No need to ask questions.

Needs to be done in c++