Using induction to prove bounds on recurrences - Part 5 - Design and Analysis of Algorithms

preview_player
Показать описание
In this video I show how to use mathematical induction to prove upper and lower bounds on a recurrence relation expressing the run time of a recursive merge sort algorithm.
Рекомендации по теме
visit shbcf.ru