A Java Program that showcases the classic merge sort but runs concurrently with multithreading. This project is for the partial completion of the course STDISCM at De La Salle University. The course ...

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

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.