Question

Show running time of algorithm on input of size $n$ is $\Omega (f(n))$

score 715 · Answer 1 · 2014-10-01 07:38:12

715

Views

Show running time of algorithm on input of size $n$ is $\Omega (f(n))$

Published on 01 Oct 2014 - 7:38

score 8.1k · Answer 2 · 2026-04-05 01:59:34

8.1k

Views

How to solve the recurrence relation for tight asymptotic bound without using master theorem?

Published on 05 Apr 2026 - 1:59

score 912 · Answer 3 · 2014-10-01 15:39:20

912

Views

Prove $f(n)=O(n^2)$

Published on 01 Oct 2014 - 15:39

score 2.3k · Answer 4 · 2014-10-02 06:54:40

2.3k

Views

Big-O Function for f(x)

Published on 02 Oct 2014 - 6:54

score 36.2k · Answer 5 · 2014-10-02 08:19:10

36.2k

Views

Arrange the following growth rates in increasing order: $O (n (\log n)^2), O (35^n), O(35n^2 + 11), O(1), O(n \log n)$

Published on 02 Oct 2014 - 8:19

score 33 · Answer 6 · 2014-10-02 22:08:50

33

Views

Inequality in the limit

Published on 02 Oct 2014 - 22:08

score 208 · Answer 7 · 2026-04-01 02:07:24

208

Views

Any power of logarithm is $O(N)$

Published on 01 Apr 2026 - 2:07

score 98 · Answer 8 · 2026-03-25 17:35:04

98

Views

correcting an invalid binary heap in $\Theta (n)$

Published on 25 Mar 2026 - 17:35

score 1.5k · Answer 9 · 2026-04-01 03:39:39

1.5k

Views

Disproving Big O Statements

Published on 01 Apr 2026 - 3:39

score 152 · Answer 10 · 2026-03-26 12:41:12

152

Views

Cumulative minimum of an Ornstein-Uhlenbeck process

Published on 26 Mar 2026 - 12:41

score 1.9k · Answer 11 · 2014-10-04 21:22:23

1.9k

Views

Can someone explain the mathematical definition of BigO?

Published on 04 Oct 2014 - 21:22

score 133 · Answer 12 · 2014-10-05 12:49:40

133

Views

Asymptotics of expectation of a ratio of binomially distributed random variables

Published on 05 Oct 2014 - 12:49

score 1.1k · Answer 13 · 2014-10-05 17:33:50

1.1k

Views

Show that $(1 + \mathcal{O}(\epsilon))(1 + \mathcal{O}(\epsilon)) = (1 + \mathcal{O}(\epsilon)) . $

Published on 05 Oct 2014 - 17:33

score 304 · Answer 14 · 2014-10-06 12:40:48

304

Views

Is $f(n) = \mathrm{e}^{o(n)}$ the same as $\,f(n) = o(\mathrm{e}^{n})$?

Published on 06 Oct 2014 - 12:40

score 559 · Answer 15 · 2026-03-29 16:33:11

559

Views

Big-O estimate (smallest order)

Published on 29 Mar 2026 - 16:33

List Question

Show running time of algorithm on input of size $n$ is $\Omega (f(n))$

How to solve the recurrence relation for tight asymptotic bound without using master theorem?

Prove $f(n)=O(n^2)$

Big-O Function for f(x)

Arrange the following growth rates in increasing order: $O (n (\log n)^2), O (35^n), O(35n^2 + 11), O(1), O(n \log n)$

Inequality in the limit

Any power of logarithm is $O(N)$

correcting an invalid binary heap in $\Theta (n)$

Disproving Big O Statements

Cumulative minimum of an Ornstein-Uhlenbeck process

Can someone explain the mathematical definition of BigO?

Asymptotics of expectation of a ratio of binomially distributed random variables

Show that $(1 + \mathcal{O}(\epsilon))(1 + \mathcal{O}(\epsilon)) = (1 + \mathcal{O}(\epsilon)) . $

Is $f(n) = \mathrm{e}^{o(n)}$ the same as $\,f(n) = o(\mathrm{e}^{n})$?

Big-O estimate (smallest order)

Trending Questions

Popular # Hahtags

Popular Questions