Substitution method for solving recurrence

Поделиться
HTML-код
  • Опубликовано: 4 фев 2025

Комментарии • 7

  • @alperendemirci157
    @alperendemirci157 2 месяца назад

    Thank you for this great lecture sir!

  • @yongfulu8984
    @yongfulu8984 3 года назад +1

    4:15, how did you get the equation after substitution?

    • @braydonnathanael4541
      @braydonnathanael4541 3 года назад

      Pro tip: watch series at flixzone. Been using them for watching all kinds of movies these days.

    • @marcusbeckham3744
      @marcusbeckham3744 3 года назад

      @Braydon Nathanael yea, I have been watching on Flixzone for since november myself =)

    • @MikeSieko17
      @MikeSieko17 Год назад +1

      i guess he substitutes it so that i matches the recurrence T(n) by multiplying by 2 and adding n, has something like: 2 T(\lfloor n / 2
      floor)+n \leq 2 c\lfloor n / 2
      floor \lg (\lfloor n / 2
      floor)+n, and then just calls 2 T(\lfloor n / 2
      floor)+n = T(n), because that is how it's defined

  • @zerobit778
    @zerobit778 3 года назад

    Thanks and I also have a question. about the 14:47 example.
    First, let's make the problem simpler but still have the point which I confused about.
    T(n) = 2T(n/2) + 1
    T(n)

  • @655rosendo
    @655rosendo 4 года назад

    Thanks for the presentation, very useful and understandable