Design and Analysis of Algorithms

Loop invariants are used to prove correctness of iterative algorithms (e.g., insertion sort, selection sort).

Master’s Theorem helps compute the time complexity of divide and conquer algorithms with recurrence relations like T(n) = aT(n/b) + f(n).

Recursive Tree and Iteration methods are also effective for recurrence analysis.

Refer Abdul Bari’s YouTube videos for clear derivations of time complexities for common sorting algorithms.