Merge sort is a sorting algorithm that uses the "Divide And Conquer" technique. It will recursively divide the array into two sub arrays until the length of the sub arrays becomes 1. A helper function ...

The example input file is numbers for 5-way merge sort. Note: The first number in the numbers file is your k or how many ways your merge sort will do. Note: The text file will be provided as a command ...