However, this can be reduced to 7 by rearranging the algorithm flow of merge sort method. A More Efficient Implementation of Merge Sort Algorithm The jump and the loop termination are two costly ...

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.