Design and Analysis of Algorithms

Analysis first

The series opens with the framework for analysing algorithms and asymptotic notation before moving into design techniques. Presented by three IIT Bombay faculty across 34 lectures, it gives the analysis groundwork that the later techniques depend on.

Techniques in the lecture list

• Divide and conquer, including median finding and closest pair.
• Greedy algorithms, spread over four lectures.
• Pattern matching, in two lectures.

Study approach

Pair each lecture with a short written summary of the technique it introduces, so the analysis and the design material stay connected.

Who it suits

Students who want a rigorous, lecture-paced treatment of algorithm design. Its ordering suits learners who like to build from analysis to technique, one lecture at a time.