Recursive Algorithm Analysis: factorial

In this video recursive algorithms are analyzed by considering the number of recursive calls and how the problem size is reduced in each call. The time complexity can be calculated using recurrence equations that mimic the mathematical definitions of recursive functions. These equations help indicate the time taken for different cases of a recursive algorithm, leading to a general solution for large instances of the problem.