Ajitq at 09:06, 5 May 2018

2018-05-05T09:06:58Z

Mbzdmvp: Created page with "Sort the first 2MB of it, and save to disk. Continue doing so until it is all sorted into sub arrays. Then use merge sort to combine sub arrays, only loading necessary data in..."

2015-01-06T04:02:07Z

Created page with "Sort the first 2MB of it, and save to disk. Continue doing so until it is all sorted into sub arrays. Then use merge sort to combine sub arrays, only loading necessary data in..."

New page

Sort the first 2MB of it, and save to disk. Continue doing so until it is all sorted into sub arrays. Then use merge sort to combine sub arrays, only loading necessary data into memory.

← Older revision		Revision as of 09:06, 5 May 2018
Line 1:		Line 1:
	Sort the first 2MB of it, and save to disk. Continue doing so until it is all sorted into sub arrays. Then use merge sort to combine sub arrays, only loading necessary data into memory.		Sort the first 2MB of it, and save to disk. Continue doing so until it is all sorted into sub arrays. Then use merge sort to combine sub arrays, only loading necessary data into memory.
		+
		+
		+	The n-way merge sort can itself be done with a heap. Maintain 250 (=500/2) pointers, add the elements pointed to to a heap, pop the minimum and increment the pointer.

TADM2E 4.43 - Revision history

Ajitq at 09:06, 5 May 2018

Mbzdmvp: Created page with "Sort the first 2MB of it, and save to disk. Continue doing so until it is all sorted into sub arrays. Then use merge sort to combine sub arrays, only loading necessary data in..."