In fact, “15 Sorting Algorithms in 6 Minutes” — created by Timo Bingmann, a PhD student at the Karlsruhe Institute of Technology — is one of the most weirdly hypnotic viewing experiences ...

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.