Yardstick for Complexity Measurement

We need to devise a way of characterizing essential performance properties of an algorithm. Hard performance measures, such as wall clock time, vary significantly when we use different computers, compilers and programming languages for expressing and running the same algorithm. For reasoning, we use the example of INSERTION-SORT algorithm as a case for study.