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.
Out of curiosity, I pulled out an old piece of merge-sort code I'd written a few years ago and compiled it using both Dev-C++ and gcc 2.95.3. Dev-C++ is a Win32 port of gcc 2.95.3, for anyone who wasn ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results