Implement a quicksort for large files on disk by replacing all array access in the normal quicksort application with access to a virtual array implemented using a buffer pool. That is, whenever a...

Implement a quicksort for large files on disk by replacing all array access in the normal quicksort application with access to a virtual array implemented using a buffer pool. That is, whenever a record in the array would be read or written by quicksort, use a call to a buffer pool function instead. Compare the running time of this implementation with implementations for external sorting based on mergesort as described in this chapter