returning to
recurrence for isort
Tisort(0) => 0;

Tisort(N) => Tisort(N-1) + Tinsert(N-1);

    < Tisort(N-1) + cN

Solving

Tisort(N) = c(1+2+ É + N)

O(n2) steps