This is demo application for external merge sort. The application reads N numbers from input file, sorts and stores in temporary file. Once the input file is read completely, all temp files are merged into one single file.

Given with a line separated text file of integers ranging anywhere from Integer.MIN to Integer.MAX, the program should be able to produce line separated text file which has the sorted content of the input file.

• Clone the repository and run gradle build to install dependencies
• Import the project into IDE and run Application

• Running sh generate.sh should generate src/main/resources/input-big.txt file with 50000 numbers.
• You can run the script multiple times to add more numbers in same file.
• To sort this file you need to make small change in Application.java:14, to change the input file name.

• Implement K-Way merge using PriorityQueue to merge the tempFiles. All tempFiles will merged at once.
  • Right now the merging process is really slow taking more than 90% of overall time and it hardly utilizes 25MB of memory
• Parallelize the split and sorting of tempFiles
  • Read N numbers from input file, create an async task to sort and save those numbers in tempFile
• Faster read operation
  • Read all N numbers from input file at once, instead of using readLine
• Dynamically decide the size of tempFiles based of available memory

Note: Ran with 1.6GB of data set and it took around 20 minutes to sort the file.

• Take input file and output files as arguments
• Log the progress on console, at each stage
• Summary - Total time taken, total temp files created, count of numbers