Question

algorithm complexity analysis using recurrence

score 38 · Answer 1 · 2026-04-01 12:58:09

38

Views

algorithm complexity analysis using recurrence

Published on 01 Apr 2026 - 12:58

score 47 · Answer 2 · 2026-03-25 19:00:26

47

Views

Log Properties for Harmonic Numbers

Published on 25 Mar 2026 - 19:00

score 128 · Answer 3 · 2026-03-26 19:18:35

128

Views

Prove that the Fibonacci function $F(n)$ is NOT $\Omega(n)$

Published on 26 Mar 2026 - 19:18

score 187 · Answer 4 · 2019-06-21 13:50:35

187

Views

Does $\sum_{i=0}^\infty{i\left((1-p^{i+1})^m-(1-p^{i})^m\right)}$ go to infinity as $\log m$?

Published on 21 Jun 2019 - 13:50

score 33 · Answer 5 · 2019-06-21 20:34:05

33

Views

I need help to find the asymptotic expansion of the following integral as n approaches infinity.

Published on 21 Jun 2019 - 20:34

score 116 · Answer 6 · 2026-03-26 19:20:02

116

Views

letting $F(n)$ denote the nth Fibonacci number, prove that $F(n)$ is not $\Omega(2^n)$

Published on 26 Mar 2026 - 19:20

score 49 · Answer 7 · 2026-04-02 06:46:43

49

Views

How to apply Big-omega to a summation.

Published on 02 Apr 2026 - 6:46

score 51 · Answer 8 · 2026-03-27 22:15:04

51

Views

Why is $f(n) = Θ(g(n))$ where, $f(n) = n^4 - n^3$ and $g(n) = 16^{\log(n)}$

Published on 27 Mar 2026 - 22:15

score 198 · Answer 9 · 2026-03-27 22:18:58

198

Views

Is the complexity of $\binom{2n}{n} = O(2^n)$?

Published on 27 Mar 2026 - 22:18

score 258 · Answer 10 · 2019-06-23 15:23:27

258

Views

To show that $o(o(x^3)-\frac{1}{2}x^2)-o(x^3)=o(x^2) \: as \: x \rightarrow 0.$ Apostol Calculus Example 1 pg.288

Published on 23 Jun 2019 - 15:23

score 130 · Answer 11 · 2026-03-26 17:30:14

130

Views

Asymptotic behavior of an inverse function

Published on 26 Mar 2026 - 17:30

score 75 · Answer 12 · 2019-06-25 09:38:59

75

Views

Asymptotic growth of $\frac{n}{\phi(n)}$.

Published on 25 Jun 2019 - 9:38

score 2.1k · Answer 13 · 2026-03-25 16:03:03

2.1k

Views

Merge sort seems to take the same number of comparisons for best and worst case.

Published on 25 Mar 2026 - 16:03

score 295 · Answer 14 · 2026-04-02 08:15:14

295

Views

What exactly constitutes the worst case input of various sorting algorithms?

Published on 02 Apr 2026 - 8:15

score 63 · Answer 15 · 2026-04-02 08:15:14

63

Views

Asymptotics: Why is $\log^2(n) \in O(n)$?

Published on 02 Apr 2026 - 8:15

List Question

algorithm complexity analysis using recurrence

Log Properties for Harmonic Numbers

Prove that the Fibonacci function $F(n)$ is NOT $\Omega(n)$

Does $\sum_{i=0}^\infty{i\left((1-p^{i+1})^m-(1-p^{i})^m\right)}$ go to infinity as $\log m$?

I need help to find the asymptotic expansion of the following integral as n approaches infinity.

letting $F(n)$ denote the nth Fibonacci number, prove that $F(n)$ is not $\Omega(2^n)$

How to apply Big-omega to a summation.

Why is $f(n) = Θ(g(n))$ where, $f(n) = n^4 - n^3$ and $g(n) = 16^{\log(n)}$

Is the complexity of $\binom{2n}{n} = O(2^n)$?

To show that $o(o(x^3)-\frac{1}{2}x^2)-o(x^3)=o(x^2) \: as \: x \rightarrow 0.$ Apostol Calculus Example 1 pg.288

Asymptotic behavior of an inverse function

Asymptotic growth of $\frac{n}{\phi(n)}$.

Merge sort seems to take the same number of comparisons for best and worst case.

What exactly constitutes the worst case input of various sorting algorithms?

Asymptotics: Why is $\log^2(n) \in O(n)$?

Trending Questions

Popular # Hahtags

Popular Questions