Figure 1. Sorting Approaches: (a) bubble sort and (b) merge sort. Listing 1: C-simulation code for bubble sort method. In the merge sort method, we start by dividing the array A into one element ...

Usually, we specify the complexity of an algorithm using the notation O(.), which indicate 'the order of'. For example, the complexity of sorting N numbers using the bubble sort method is O(N2) and ...

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.