Recursive Call - Time-efficiency of Recursive Algorithms

Time-efficiency of Recursive Algorithms

The time efficiency of recursive algorithms can be expressed in a recurrence relation of Big O notation. They can (usually) then be simplified into a single Big-Oh term.

Read more about this topic:  Recursive Call