Register

Recent questions tagged time-complexity

0 votes
1 answer
392
UPPCL 2018 AE
Time complexity of this Recurrence relation T(n)=T(√n) +1 O(nlogn) O(log log n) O(n^2) n^2 logn
Time complexity of this Recurrence relation T(n)=T(√n) +1O(nlogn)O(log log n)O(n^2)n^2 logn
User Avatar
0 votes
1 answer
394
MadeEasy Test Series 2019: Algorithms - Time complexity
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c,like cant we take both the recurrance call as combined as both have same parameter?and if not, then ...
User Avatar
0 votes
1 answer
397
#timecomplexity
What is difference between tightest upper bound and tightest lower bound? Give ur explanation with examples?
What is difference between tightest upper bound and tightest lower bound? Give ur explanation with examples?
User Avatar
0 votes
1 answer
399
MIN HEAP
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not? (A) O(log n) (B) O(n) (C) O(n logn) (D) O(1)
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not?(A) O(log n)(B) O(n)(C) O(n logn)(D) O(1)
User Avatar
1 votes
1 answer
400
Deleting a random node from Heap
What is the time complexity of 'deleting any random node from a max or min heap'?
What is the time complexity of 'deleting any random node from a max or min heap'?
User Avatar
0 votes
1 answer
403
made easy adv 2018
The median of n elements can be found in O(logn) time.which one of the following is correct about worst case time complexity of quick sort,if always median is selected as pivot element? a)O(logn) b)O(n) c)O(nlogn) d)O(nloglogn)
The median of n elements can be found in O(logn) time.which one of the following is correct about worst case time complexity of quick sort,if always median is selected a...
User Avatar
0 votes
1 answer
405
Question_bank
f(n)=O(g(n)) Which of the following is True? 2^f(n)=O(2^(g(n)) log(f(n))=O(log(g(n)) f(n)=O(f(n/2)) f(n)=O(f(n)^2)
f(n)=O(g(n))Which of the following is True?2^f(n)=O(2^(g(n))log(f(n))=O(log(g(n))f(n)=O(f(n/2))f(n)=O(f(n)^2)
User Avatar
0 votes
0 answers
407
Testbook test series
Will the complexity of the function be $\Theta n^{2} or \Theta n^{3}?$
Will the complexity of the function be $\Theta n^{2} or \Theta n^{3}?$
User Avatar
0 votes
0 answers
408
GATEBOOK
Please mention proper approach to solve similar questions
Please mention proper approach to solve similar questions
User Avatar
1 votes
2 answers
411
Made Easy Test Series
What is worst case time complexity to delete middle element from the min heap of n distinct elements? O(logn) O(n) O(nlogn) O($n^{2}$)
What is worst case time complexity to delete middle element from the min heap of n distinct elements?O(logn)O(n)O(nlogn)O($n^{2}$)
User Avatar
1 votes
1 answer
412
Kth Largest element in Min-Heap
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?
User Avatar
0 votes
0 answers
413
ME- OTS 2
Better than O(n) exists ?
Better than O(n) exists ?
User Avatar
0 votes
0 answers
414
ME - OTS 1
User Avatar
0 votes
1 answer
415
Time Complexity : ME OTS
User Avatar
0 votes
2 answers
417
Doubt : TC
How the limits are reduced. Please explain in simpler way.
How the limits are reduced. Please explain in simpler way.
User Avatar
0 votes
0 answers
418
Made Easy TestS
An array with n distinct element In array till ith position elements are in increasing order after ith position elements are in decreasing order time Complexity to find i A.O(nlogn) B.O(logn) C.O(n) D.O(loglogn)
An array with n distinct element In array till ith position elements are in increasing order after ith position elements are in decreasing order time Complexity to find i...
User Avatar
0 votes
0 answers
419
#SELF DOUBT
Prove dijkstra’s algorithm using Heap is O((n+|E|)logn) where n is no.of vertices and |E| is number of edges? Book : Fundamentals of Computer Algorithms By sahni page : 263
Prove dijkstra’s algorithm using Heap is O((n+|E|)logn) where n is no.of vertices and |E| is number of edges?Book : Fundamentals of Computer Algorithms By sahni pa...
User Avatar
Page: