When is mergesort preferred over quicksort?
Both quicksort and mergesort can work just fine if you can’t fit all data into memory at once. You can implement quicksort by choosing a pivot, then streaming elements in from disk into memory and writing elements into one of two different files based on how that element compares to the pivot. If you use … Read more