6.15 External Sorting
6.15 External Sorting External sorting handles datasets that do not fit in main memory. The cost model changes from CPU time to I O. The goal is to minimize disk reads and writes by organizing the algorithm around sequential access and large transfers. Problem You have a dataset too large to fit into memory. You want to sort it using limited RAM and disk storage. Model Assume: N = number...