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.