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

preview_player
Показать описание
In this video we use mathematical induction to prove linear upper and lower bounds on a recurrence relation expressing the runtime of a recursive search algorithm.
Рекомендации по теме
Комментарии
Автор

i dont get the part where you put for all k<n but you don't have k in the inductive process?

yevgeniydiriyenko
Автор

I'm curious, why didn't you use k+1 in these examples? Normally k+1 is used in the inductive step

markinius
Автор

What if we choose n0 to some value other than 1, then will the base case change?

zumanahaseen
welcome to shbcf.ru