Thread: what is ALGORITHM this implementation an sorting and ascending order.

Originally Posted by iMalc

[..]For time, a common measure is the number of comparisons between items.[..]

I would add the number of copy operations. A careful implementation of insertion sort, for example, requires only O(n log n) comparisons. (You can use a binary search to determine the insertion point)