CS 106B Sum 2019- Week 4 Section: Recursive Backtracking

Поділитися
Вставка
  • Опубліковано 3 сер 2019

КОМЕНТАРІ • 9

  • @alexcisija7424
    @alexcisija7424 Рік тому +3

    Brilliant teacher!!! The colors, the breakdown, explaining, examples... so good! Thank you so much for sharing! I'm so happy I can understand this topic now! :)

  • @dramamama2570
    @dramamama2570 2 роки тому +4

    This video really deserves more views. After this video I have mastered backtracking essentially

  • @cschipg4688
    @cschipg4688 Рік тому +6

    Lecture starts at 3:40

  • @abdallahelhdad819
    @abdallahelhdad819 Місяць тому

    this is so good! thank you.

  • @wew8820
    @wew8820 24 дні тому

    this dude is making me want to go to stanford

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

    Explained very well. Thank you Avery!
    For the total sum question though, wouldn't it be more efficient if we used another variable 'index' to keep track of which number we are using instead of removing/adding to the list/vector?

  • @tseringdhondup592
    @tseringdhondup592 Рік тому +3

    Hey Avery! You mentioned that there are 9 problems you did concerning this topic which sets you up for any backtracking questions. I was wondering what those might be! Although I am starting to see some sort of patterns problem to problem, I feel like I am one small step away from fully understanding what I am doing.

  • @jamesabasifreke
    @jamesabasifreke 7 місяців тому

    @ minute 50:58 why do we need to add back the val to choices when we have found an answer? I believe the question isn't asking to find all solutions but rather if there's a solution. Is there a point to adding val back to choices when you would be ending the recursion here? @Avery Wang