https://github.com/levongh/external_sort
https://github.com/levongh/external_sort
Last synced: about 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/levongh/external_sort
- Owner: levongh
- Created: 2018-10-13T07:06:30.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2020-08-17T11:50:02.000Z (almost 6 years ago)
- Last Synced: 2025-02-09T09:12:34.032Z (over 1 year ago)
- Language: C++
- Size: 19 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 3
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# external sort
External sorting is a class of sorting algorithms that can handle massive amounts of data. 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 disk drive. Thus, external sorting algorithms are external memory algorithms and thus applicable in the external memory model of computation.
External sorting algorithms generally fall into two types, distribution sorting, which resembles quicksort, and external merge sort, which resembles merge sort. The latter typically uses a hybrid 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.