Merge-and-Shell-Sort-Benchmark 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 ...

Merge sort is a sorting algorithm that uses the "Divide And Conquer" technique. It will recursively divide the array into two sub arrays until the length of the sub arrays becomes 1. A helper function ...

In recent years with the advent of programming techniques, parallel programming consumes less execution time as compared to sequential. The odd-even merge ...