HOME
        TheInfoList






Recursive2.svg

Time-efficiency of recursive algorithms

The 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-O term.

Shortcut rule (master theorem) T ( n / b<

Then the Big O of the time-complexity is thus: