Is there a better way to benchmark a C program than timing?
问题 I'm coding a little program that has to sort a large array (up to 4 million text strings). Seems like I'm doing quite well at it, since a combination of radixsort and mergesort already cut the original q(uick)sort execution time in less than half. Execution time being the main point, since this is what I'm using to benchmark my piece of code. My question is: Is there a better (i. e. more reliable) way of benchmarking a program than just time the execution? It kinda works, but the same program