Yet another Sort benchmark
TODO #1 - Implement median of 3 #2 - compare random pivot with median of 3 #3 - Port Bentley's implementation to template based #4 - Port dual pivot implementation to template based #5 + Do a experiment for selecting cutoff #6 + Testing on other data type #7 + C++ Language special: Move of STD InsertionSort #8 + writing a program to count compare and swap