2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2
670,070 views
About this video
From a channel a BrighterTube curator vetted · 80% confidenceFrom a channel Lumen includes in full: Abdul Bari's whiteboard lectures on algorithms, data structures, and C/C++/Java programming are a standard companion to university algorithms courses, working every technique — greedy, DP, backtracking, branch and bound — through worked examples.
A 7-minute video from Abdul Bari's catalogue; the title names its topic.
Video by Abdul Bari, played through YouTube's embedded player.
Part of Algorithms