Register

Ace Test Series: Algorithm - Time Complexity

• edited by
268 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
KISHALAY DAS asked Dec 25, 2016
737 views
ACE-TestSeries:-Algorithm Time Complexity
Determine the time complexity of the program segment given below: k = n; while ( k > 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; } $\Theta\left(n^2\right)$ $\Theta(n \log n)$ $\Theta(\log^2 n)$ $\Theta\left(\log n \sqrt n\right)$
Determine the time complexity of the program segment given below:k = n; while ( k 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; }$\Theta\left(n^2\right)$$\Theta(n \log...
User Avatar
1 votes
1 votes
2 answers
2
akankshadewangan24 asked Sep 20, 2018
902 views
Ace Test Series: Algorithms - Time Complexity Notation
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...
User Avatar
0 votes
0 votes
3 answers
3
Subham Nagar asked Mar 20, 2018
1,333 views
Ace Test Series: Algorithms - Time Complexity & Array
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$. $O(n^2) $ $O(1)$ $O(n)$ $O(logn)$
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...
User Avatar
0 votes
0 votes
0 answers
4
Kai asked Jan 29, 2017
441 views
Ace Test Series: Algorithms - Time Complexity
Time complexity of the given program is?
Time complexity of the given program is?
User Avatar
Link Copied!