you will implement an algorithm that can sort data sets that are too large to fit in working memory. For this project we will use integer data stored in a binary file.
computer science
Description
Overview
For this project, you will implement an algorithm that can sort data sets that are too large to fit in working memory. For this project we will use integer data stored in a binary file. The file is too large to be read into the program all at once. Therefore, the data will be read into the program in segments of a size that can be stored in working memory. The segments can be sorted, and written back to a temporary file. These segments can then be merged together to form a sorted file. The use of input and output streams makes it possible to read and write to temporary, binary files without storing more than a fraction of the data that is being sorted. The code is generalized to work with other types of data sources, but for this project you will use integer data.
