A Java program to benchmark Selection Sort and Merge Sort, measuring performance on random data. The framework provides a generic Sorter class, TimeTest for timing analysis, and tools for generating ...

This is a Benchmark program I developed in Java for my CMSC 451 class that compares the perormance bwtween the Merge sort and Shell Sort algorithms. It specifically compares the average 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.