Comment on running times

I use the following sizes for random array: {10,10,100,100,1000,1000,10000,10000,100000,100000}

I repeat each size two times to limit the possibility for outliers

The running times in nanosec I obtained for MaxSort using shiftRight method: 

11730 3171 142330 179961 3692436 2215182 41814677 42257959 3559183002 3458047857

The running times in nanosec I obtained for MaxSort using swap method: 

6654 1395 14350 21122 398978 382964 24520133 24016434 2425156654 2338061780

MaxSort using swap gives better running times - after 10000 sizes approx. 2x better.

This is expected as the number of operations using swap is fewer then using shiftRight.