Pages External Merge Sort External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory (usually a hard drive). External sorting typically uses a sort-merge strategy. In the sorting phase, chunks of data small enough to fit in main memory are read, sorted, and written out to a temporary file. In the merge phase, the sorted subfiles are combined into a single larger file. One example of external sorting is the external merge sort algorithm,
Read full article from Ashish Sharma's Tech Blog: External Merge Sort
No comments:
Post a Comment