L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm

Whole-channel inclusion: Gate Smashers is an honest teaching channel (title sample + 3 transcripts read: All three samples lack transcripts, so the verdict relies on the title-sample assessment that Gate Smashers consistently delivers structured CS lectures and exam-prep tutorials.); this title passed a strict title check (sonnet) after a labelling pass.