Posted on January 21, 2014
Interview questions: Sorting a terabyte of integers with a gigabyte of memory (part 2)
In the previous article, I mentioned that the mergesort algorithm could be modified in order to solve this problem. The usual mergesort implementation assumes that all the unsorted elements can fit into main memory. The algorithm divides the… Read More
Posted on January 15, 2014
Interview questions explained: Sorting a terabyte of integers with a gigabyte of memory
Given a terabyte of unsorted 32-bit unsigned integers on disk and only one gigabyte of memory, sort the integers. At first glance, mergesort would be the first solution that comes to mind. However, the typical mergesort implementation assumes… Read More