Question

You are working on an hospital database that only has 4 KB of free memory and you
wish to sort the 20,00,000 patient admission history by the age of the patient
(discarding the original order of admission).
Which sorting algorithm is best? (Selection sort, bubble sort, quick sort, heap sort).
There is a situation where a patient had not visited hospital for the past 10 years but
his details are already registered at the time of his first visit ten years before. The
patient missed his patient ID also. Now after ten years he revisits the hospital and
wants his patient record file to meet the doctor.
Analyse which search algorithm best suits the hospital management for finding the
patient’s record file.

Write a C program to implement the appropriate sort and search algorithm for the
above scenario.

Answer 1

bye bye because I can leave from brainly