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 ...
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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback