Digital root is the recursive sum of all the digits in a number. Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit ...

- Analysis of Algorithms(Background) - Asymptotic Analysis - Order of Growth - Best, Average and Worst cases - Asymptotic Notation - Big O Notation - Omega Notation - Theta Notation - Analysis of ...