Array of Pairs - O(n2)
Cubic Loop - O(n3)
Count Digits - O(Log N)
Recursive Logarithmic Sum - O(N Log N)
Recursive Fibonacci - O(2n)
Factorial - O(n!)
Play Predefined Example
1
function addUpTo(n: number){
2
let total = 0;
3
4
for (let i = 0; i < n; i++) {
5
total =+ i;
6
}
7
8
return total;
9