Register

Ace Test Series: Algorithm - Time Complexity

• edited by
417 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · GateForum Test Serie...Next → · Pipelining
← Previous in category · Algorithms - Complex...Next in category → · please solve this Q
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
1.2k
1.2k views
KISHALAY DAS asked Dec 25, 2016
1,248 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...
1 1 vote
2 2 answers
1.8k
1.8k views
akankshadewangan24 asked Sep 20, 2018
1,783 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 H...
0 0 votes
3 3 answers
3.4k
3.4k views
Subham Nagar asked Mar 20, 2018
3,427 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$...
0 0 votes
0 0 answers
763
763 views
Kai asked Jan 29, 2017
763 views
Ace Test Series: Algorithms - Time Complexity
Time complexity of the given program is?