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

1st loop = gap = n/2 sey gap nikalta ha r gap = gap/2 yeh har iteration me divide hota rahy ga untill 1 na ajaye 2nd loop = start ho gi current gap sy array k lat tak j index k us element k represent ...