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 ...

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 ...