CareerCup

Assume you have a file with 5Mb size.
Each line in file has a interger. (and only one integer per line).
Now, your system can process only 1Mb data at a time in memory, that is you cannot access more than 1Mb of data at a time.

Write a program that sort the file under this circumstances.

Answer I gave:
This problem is basically, you have array of 100 number, and at time you can access only 10 of them. Then sort the array.
He was happy to see this analogy, and then my algo.

Divide the array into 10 segments of each, and sort each one of them individually.
Now, take the first element of each sort subarray and find the min.
Put this min into differnt array of the size 100 at its starting location.

Repeat this process, for the next element from the subarray which had the smallest element as identified earlier.

He seemed to be ok with this.
Any other approach?