#1. Recursion introduction and identification

Study notes from Aditya Verma's recursion playlist, video 1. The method, the framing and the examples are his — this page is my write-up while working through it, kept here so I can revise from it. Watch the original; these notes are no substitute for it.

Where these disagree with the handbook's recursion pages, these win — those were written without watching anything.

Video: https://www.youtube.com/watch?v=kHi1DUhp9kM Playlist: https://www.youtube.com/playlist?list=PL_z_8CaSLPWeT1ffjiImo0sYTcnLzo-wY

#What he actually said

<in his framing, not mine. if he uses a specific phrase for something, keep his phrase -- that is the thing you will recall later>

#The idea

<two sentences. if you cannot, you have not got it yet, and that is worth knowing now rather than in an interview>

#Diagram

<the tree, or the reduction. draw it for n=2 or n=3, never n=6>

#Code

# typed from understanding, not copied from the screen

#Why it works

#What tripped me up

<the whole value of these notes is here. write what you got wrong, because that is what you will get wrong again>

#Problems to do

#Stop condition

I have got this when I can: