Question: Searching & Sorting Algorithms. Code must generate exactly as the sample output given. You are required to develop a complete C program that helps a

Searching & Sorting Algorithms.
Code must generate exactly as the sample output given.
You are required to develop a complete C program that helps a lecturer to manage student records. Each student's record contains information like student identification number, name, course major and CGPA, and they are stored in a text file. The software reads students' information from a file, and allows the lecturer to do the following: print the list of student records, add new student record (appended at the end of the record), update information on existing record, sort student records (according to student identification number) into ascending order, save the updated student records in a file. In updating student's details, one needs to search for the student record from the existing records. In this application, linear search and binary search are to be implemented. On the other hand, selection sort and insertion sort algorithms are to be implemented to sort data. Note that two for each sorting and searching algorithms are used in the program. Your program should select the suitable algorithms accordingly. For example, if the lecturer opts to search for a student details from a medium size of an unsorted student records, in this case binary search is more preferable over linear search for faster time complexity. However, binary search requires input data to be sorted. In selecting sorting algorithm, the program might want to consider the randomness of the data. A sample output is given below: Options available: print all record add new record update existing record sort records
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
