Register

Algorithm analysis

683 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · ace test seriesNext → · madeeasy
← Previous in category · Asymptotic notationNext in category → · Algorithms
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
984
984 views
Rishav Kumar Singh asked Jul 26, 2018
984 views
UBC Intermediate Algorithm Design and Analysis (CPSC 320) Summer 2009
Analyze the runtime of the following piece of code. Give a bound using Θ notation.function Pesky(n)r ←0;for i ←1 to ndo for j ←1 to ido for k ← j to i+jdo r ←r + 1;return...
1 1 vote
1 1 answer
2.7k
2.7k views
Agam asked Jan 4, 2017
2,732 views
Algorithm-asymptotic analysis
=====>f(n)=3n^2+4n+2. What will be the exact value for f(n) a) theta(n^2) b)o(n^2) c)O(n^2) d)omega(n^2) Please pr...
0 0 votes
1 1 answer
131
131 views
GO Classes asked Aug 25
131 views
GO Classes DPP | GATE CS, DA | Algorithms | Asymptotic Analysis
Let $T_A(n)$ and $T_B(n)$ denote the worst-case running times of two algorithms $A$ and $B$ that solve the same problem.We say that $A$ is asymptotically more efficient t...
0 0 votes
1 1 answer
142
142 views
GO Classes asked Aug 8
142 views
GO Classes DPP | GATE CS, DA | Algorithms | Asymptotic Analysis
Consider the following functions$f(n)=3n^{\sqrt{n}}$$g(n)=2^{\sqrt{n}\log_2 n}$$h(n)=n!$Which of the following is true?$h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)\neq O...