Recurrences for Earlier Sorts

We can write recurrences for the previous sorts as follows:

• insertion sort: T(n) = T(n-1) + n
• Bubblesort, selection sort: T(n) = n + T(n-1).

All basically focus on sorting a single element per iteration.