Dynamic Programming: Subset Sum

Поділитися
Вставка
  • Опубліковано 2 лют 2025

КОМЕНТАРІ • 10

  • @SamWhitlock
    @SamWhitlock 3 роки тому +4

    The pedagogical steps in this are truly invaluable. It helps so much to see progression towards the final answer than to just have it pulled out like a rabbit out of a magician's hat!

    • @AlgorithmswithAttitude
      @AlgorithmswithAttitude  3 роки тому

      Thanks. The hope is to give some intuition of where the final, polished algorithm comes from, in part so that students realize, you don't have to get there in one step. It is a lot to expect of one's self to just go from the problem, directly to the final answer.

  • @1PercentPure
    @1PercentPure 3 роки тому +1

    I've been watching your videos for a long time. Really helps me every now and then. Thank you!

  • @skfofiwjdnddntngnfkeso3185
    @skfofiwjdnddntngnfkeso3185 2 роки тому

    Favorite Chanel love your teaching style hope you can upload more often

  • @danilkryuchkov1666
    @danilkryuchkov1666 2 роки тому

    This is incredible! Great stuff! best explanation I've seen

  • @sheltonsong6120
    @sheltonsong6120 2 роки тому +1

    9:51 Line 6, shouldn't it be for(j=1; j

  • @TheOtherBradBird
    @TheOtherBradBird 3 роки тому

    I will have to bookmark this until I've digested the prerequisites. Good to see a new video though.

    • @AlgorithmswithAttitude
      @AlgorithmswithAttitude  3 роки тому

      It's not exactly new, but a student noticed something wrong with some pseudocode, so I fixed it and rereleased it.

    • @TheOtherBradBird
      @TheOtherBradBird 3 роки тому

      @@AlgorithmswithAttitude I suppose I should have noticed that it said 2020. This is probably the sign that I should go to bed.