Get Instant Help From 5000+ Experts For

Writing: Get your essay and assignment written from scratch by PhD expert

Rewriting: Paraphrase or rewrite your friend's essay with similar meaning at reduced cost

Editing:Proofread your work by experts and improve grade at Lowest cost

And Improve Your Grades
Phone no. Missing!

Enter phone no. to receive critical updates and urgent messages !

Attach file

Error goes here

Files Missing!

Please upload all relevant files for quick & complete assistance.

Guaranteed Higher Grade!
Free Quote
Student Information System with Sorting and Searching Algorithms


A) Your program should develop functions and menu-driven to do the following:
1.Create a student information structure
2.Studfunc(): Read/ Modify (update) student information and marks
3.Markfunc(): Marks Entry of each student (course 01-04)
4.Calculate Total, and Per%
5.InsertSort(): Display student information in Sorted order by ID or Age (use Linear algorithm).
6.QuickSort(): Display student percentage in descending order (use Binary algorithm).
7.Search and view student total and other details of the student with key field St_ID using (Binary search tree), then traverse the tree to print its contents
B) compare, evaluate, and describe the performance of the sort and search algorithms in (5, 6 and 7). This could be done by measuring the time or count the key steps in each sort/search like the number of comparisons.
To perform the efficiency of the algorithm you need to add a counter variable count_measu to the function to count the number of the listed items that were found while searching and sorting. (Hint: the counter starts at value of zero, then add one to the count_measu at every time you traverse the list to check a new item of the list. When finishing the algorithm print the count_measu).

sales chat
sales chat