Question

Use the limit rule to find Big Oh characterization of for loop

score 955 · Answer 1 · 2026-04-11 18:47:38

955

Views

Use the limit rule to find Big Oh characterization of for loop

Published on 11 Apr 2026 - 18:47

score 963 · Answer 2 · 2026-04-16 21:02:12

963

Views

Show that $\sum_{i=1}^{n}[\log_{2}(n/i)]$ is O(n), hint use Stirling's Approximation

Published on 16 Apr 2026 - 21:02

score 323 · Answer 3 · 2026-04-30 07:20:59

323

Views

Asymptotic expansion of the solution of $f_n(x)=x^5+nx-1=0$

Published on 30 Apr 2026 - 7:20

score 38 · Answer 4 · 2026-04-16 01:12:51

38

Views

Suppose that the $\lim_{n\to\infty} \frac{h(n)}{\max\{f(n), g(n)\}} < \infty$. Show that $h(n)=O(f(n)+g(n))$

Published on 16 Apr 2026 - 1:12

score 353 · Answer 5 · 2026-04-16 09:58:03

353

Views

Asymptotic behavior of $1/\ln n$ and $e^x-1$

Published on 16 Apr 2026 - 9:58

score 928 · Answer 6 · 2026-04-12 18:52:42

928

Views

Find Big-Theta for the following program

Published on 12 Apr 2026 - 18:52

score 40 · Answer 7 · 2026-04-09 06:07:08

40

Views

How do these 2 nested for loops differ in terms of Big Oh

Published on 09 Apr 2026 - 6:07

score 91 · Answer 8 · 2026-04-14 22:59:39

91

Views

Knowing that liminf $x_n$ and limsup $x_n$ are in [-1,1], how to express this using big-O, small-o notation?

Published on 14 Apr 2026 - 22:59

score 89 · Answer 9 · 2026-04-11 09:01:30

89

Views

Trigonometric Functions and Asymptotics

Published on 11 Apr 2026 - 9:01

score 3.7k · Answer 10 · 2026-04-16 15:04:28

3.7k

Views

Show that n^3 log n is Ω(n^3)

Published on 16 Apr 2026 - 15:04

score 2.3k · Answer 11 · 2026-04-17 07:54:55

2.3k

Views

Show that $\sum \limits_{i=1}^n log(i)$ is O(n log n)

Published on 17 Apr 2026 - 7:54

score 219 · Answer 12 · 2026-04-12 17:46:04

219

Views

Find Big Oh for nested for loop with floor function

Published on 12 Apr 2026 - 17:46

score 1.3k · Answer 13 · 2026-04-13 19:10:26

1.3k

Views

Find big theta of summation

Published on 13 Apr 2026 - 19:10

score 3.7k · Answer 14 · 2026-05-04 08:52:19

3.7k

Views

Solving recurrence relation: $T(n)=2T(n-1)+1$, using recursion tree and substitution

Published on 04 May 2026 - 8:52

score 237 · Answer 15 · 2026-04-14 15:45:34

237

Views

Which function grows at a faster rate? $n!$ or $2^{n^2}$

Published on 14 Apr 2026 - 15:45

List Question

Use the limit rule to find Big Oh characterization of for loop

Show that $\sum_{i=1}^{n}[\log_{2}(n/i)]$ is O(n), hint use Stirling's Approximation

Asymptotic expansion of the solution of $f_n(x)=x^5+nx-1=0$

Suppose that the $\lim_{n\to\infty} \frac{h(n)}{\max\{f(n), g(n)\}} < \infty$. Show that $h(n)=O(f(n)+g(n))$

Asymptotic behavior of $1/\ln n$ and $e^x-1$

Find Big-Theta for the following program

How do these 2 nested for loops differ in terms of Big Oh

Knowing that liminf $x_n$ and limsup $x_n$ are in [-1,1], how to express this using big-O, small-o notation?

Trigonometric Functions and Asymptotics

Show that n^3 log n is Ω(n^3)

Show that $\sum \limits_{i=1}^n log(i)$ is O(n log n)

Find Big Oh for nested for loop with floor function

Find big theta of summation

Solving recurrence relation: $T(n)=2T(n-1)+1$, using recursion tree and substitution

Which function grows at a faster rate? $n!$ or $2^{n^2}$

Trending Questions

Popular # Hahtags

Popular Questions