This project is an implementation of an external, p-way balanced merge sort algorithm in Java. It was developed as a requirement for the MATA54 - Data Structures and Algorithms II course at UFBA. The ...

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 ...

In recent years with the advent of programming techniques, parallel programming consumes less execution time as compared to sequential. The odd-even merge sort algorithm was developed by K.E. Batcher.