Using strong induction to prove bounds on a recurrence relation - Discrete Math for Computer Science

In this video I use strong induction to prove upper and lower bounds for a recurrence relation derived from a recursive implementation of insertion sort.