1. Binary insertion sort uses binary search to find an appropriate position to insert A[i] among the previously sorted A ≤ ... ≤ A[i−1]. Give the Pseudocode for binary insertion sort (30%).
Note: If it is not binary insertion sort, you will get 0 credit.
2. Determine algorithm’s worst-case efficiency class regarding the key comparisons (20%).
3. Use binary insertion sort algorithm to sort a list of student records that contain
student's ID, name, age, and GPA. (Use student ID as the sorting key (50%)
a. Create a text file containing at least 10 students records
b. Your program has to write sorted records into another text file.
c. Your program has to display student records before and after sorting.
d. In your project report (in PDF or MS Word format), it should have
i. Source codes
ii. Input text file (unsorted)
iii. Output text file (sorted)
iv. Screen snap shot when you run your program to show records before and
Note: You have to use binary insertion sort to sort the students’ records. If it is not binary insertion sort, you will not get credit.