Computing Time Spent on Selection Sort

Since each card handling takes a minimum amount of time, say, 1/10 of a second, and a maximum amount of time, say 10 seconds, then since

¼n² ≤ H(n) ≤ 2n²

We have:

¹⁄₄₀n² ≤ T(n) ≤ 20n²

Since T(n) is also between multiples of n², we say

T(n) = Θ(n²)

Both the number of handlings and the time taken is Θ(n²).

n² tells the general shape or order of growth of both H(n) and T(n).