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.

To merge two or more sets of data together and eliminate unwanted items. For example, a new name and address list can be added to an old list while deleting duplicate names or names that meet certain ...