Time Complexity for $T(n) = T(\sqrt{n}) + 1$
52324
Tight bound for $T(n) = T(n^{1/2}) + 1$
144890
Recurrence $f_{n+2}=af_{n+1}+bf_n$
42724
Time complexity of memory allocation
86205
Evaluating the limit of a sequence given by recurrence relation $a_1=\sqrt2$, $a_{n+1}=\sqrt{2+a_n}$. Is my solution correct?
21428
Running time complexity of double for-loops
79071
Solve the recurrence $T(n) = 2T(n-1) + n$
118244
An $n$th root inequality: $\sqrt[n]{n} < 1 + \sqrt{2/n}$
17371
Recurrence relation for number of ternary strings that contain two consecutive zeros
71821
How do I derive the time complexity of encryption and decryption based on modular arithmetic?
67792
Question about the simplex method complexity
11998
In how many sequences of length $n$, the difference between every 2 adjacent elements is $1$ or $-1$?
132118
Computing the $n^{\textrm{th}}$ permutation of bits.
30273
Fibonacci Recurrence Relations
86342
Why does $\log(n!)$ and $\log(n^n)$ have the same big-O complexity?
149549
Infimum of $n$-th root of $n$
142981
Computing $n!\int...\int_{0<s_1<...<s_n}1ds_1...ds_n$
123495
Find the asymptotic tight bound for $T(n) = 4T(n/2) + n^{2}\log n$