A toy implementation of K-way Merger in Go. The app:
- Receives a list of input files and an output file
- Sort integers in each input file by increasing order and rewriting the result to the input file
- Merge all integers in all input files and write the result to the output file using a binary heap.
A possible application scenario: Sorting billions of integers after splitting them into multiple files.
To build the image and execute the unit tests in a docker container, run:
docker build --no-cache -t kwaymerger-image01 .
docker run --name kwaymerger-container01 kwaymerger-image01- go 1.17