1

17) Problem: Sort a file of huge records with tiny keys > It means less comparison overhead but more exchange overhead (i.e., Reorganize your Video files). Which method to use? 1. merge sort, guaranteed to run in time ~NigN 2. selection sort 3. bubble sort a custom algorithm for huge records/tiny keys 5. insertion sort17) Problem: Sort a file of huge records with tiny keys > It means less comparison overhead but more exchange overhead (i.e., Reorganize your Video files). Which method to use? 1. merge sort, guaranteed to run in time ~NigN 2. selection sort 3. bubble sort a custom algorithm for huge records/tiny keys 5. insertion sort