The following procedure is for the selection sorting:

1. Calculate the execution time for every statement (assume the execution time for each primitive operation is one unit. For example the execution time of a[i] > a[iMin] is one plus two reads.
2. Develop the control flow graph
3. Carry the complete analysis to derive the execution time equation.
4. Provide the physical meaning and the range of values for the flows in terms of n and each independent flow.

int iji 3 int n; // initialise to a's length 5 advance the position through the entire array *, could do j<-1>