← Questions
Merge sorted arrays, then sort files too large for memory
0
I was asked this
No reports yet. Sign in to say where you were asked it.
- Merge two sorted arrays of integers into one sorted array.
- The two inputs are now huge files that don't fit in memory. Merge them with bounded memory and buffered reads and writes.
- Now sort N large unsorted files into one globally sorted output: sort chunks, then do a K-way merge with a heap, and discuss doing it across several machines.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding
