List questions from asymptotics

Published on 29 Mar 2026 - 10:18

281

Views

Proof of inequalities (relating to Big O notation)

Published on 14 Sep 2019 - 0:31

160

Views

Asymptotic equivalence-like relation

Published on 14 Sep 2019 - 9:46

48

Views

Solving the recurrence: $T(n)=9T(n^{1/6})+\log^2(n)$

Published on 27 Mar 2026 - 18:08

57

Views

Amortized analysis (dynamic arrays) - how is the cost of 1 -> 2 -> 4 -> 8 ... 2N = 4N - 1?

Published on 28 Mar 2026 - 5:22

459

Views

asymptotic expansion of $(1-a)^n$

Published on 15 Sep 2019 - 9:23

43

Views

Finding $\sum_{i=0}^{\log_2\log_2n} n^{\frac{2^{i+1}-1}{2^i}}$

Published on 26 Mar 2026 - 2:55

138

Views

Proving $2^n = o(3^n)$

Published on 28 Mar 2026 - 6:58

51

Views

Difficulty understanding the relation between the representation of a number and the time complexity of searching for (0, N - 1)?

Published on 25 Mar 2026 - 6:42

2.4k

Views

Why is $\sqrt x \in O(\log(x)) $?

Published on 16 Sep 2019 - 19:06

71

Views

What will be the complexity of $T(n) =T(n/4) +T(n/2) +n^2?$

Published on 02 Apr 2026 - 3:16

33

Views

Need help with calculating asymptote equation

Published on 29 Mar 2026 - 18:31

2.8k

Views

What does $n_0$ mean when describing Big-O notation?

Published on 17 Sep 2019 - 9:56

46

Views

Prove recursively function f(x) is O(n)

Published on 02 Apr 2026 - 9:31

391

Views

Dealing with little o(1) term in ODE

Published on 17 Sep 2019 - 14:42

List Question

Asymptotic behaviour of a counting function

Proof of inequalities (relating to Big O notation)

Asymptotic equivalence-like relation

Solving the recurrence: $T(n)=9T(n^{1/6})+\log^2(n)$

Amortized analysis (dynamic arrays) - how is the cost of 1 -> 2 -> 4 -> 8 ... 2N = 4N - 1?

asymptotic expansion of $(1-a)^n$

Finding $\sum_{i=0}^{\log_2\log_2n} n^{\frac{2^{i+1}-1}{2^i}}$

Proving $2^n = o(3^n)$

Difficulty understanding the relation between the representation of a number and the time complexity of searching for (0, N - 1)?

Why is $\sqrt x \in O(\log(x)) $?

What will be the complexity of $T(n) =T(n/4) +T(n/2) +n^2?$

Need help with calculating asymptote equation

What does $n_0$ mean when describing Big-O notation?

Prove recursively function f(x) is O(n)

Dealing with little o(1) term in ODE

Trending Questions

Popular # Hahtags

Popular Questions