GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
344 views
In a min-heap with n elements

1).  The 7th smallest element can be found in time, if duplicates are allowed ?

2).  The 7th distinct smallest element can be found in time, If duplicates are allowed ?
asked in Algorithms by Veteran (44.9k points)   | 344 views
O(n)  for both.
For 2nd one , O(n) is right, as we have to use hashtable .

For 1st, O(lgn) is given . I think it should be O(1) .
Ohh ... yes ... if we have elements like - 1,2 ,3,3,4,4,5,5,5,6,6,6,7

And ans for 1st is 5 and for 2nd it is 7 then you are correct...
1) O(1), because we can do it in constant time

2) O(N) counting sort will be applied
I agree the operation concerned is find() , which takes O(1) if duplicates are allowed but if asked for distinct 7th minimum and duplicates are allowed we may need to do find() operation for entire tree which will take O(n) time

2 Answers

0 votes

It will take O(1)

    

 

answered by Active (2.1k points)  
I think same here

but for 1st one, answer is given O(lg N).
0 votes
For first one :

O(log n)

Reason : To delete an element , it takes O(1), then we have to heapify , which takes O(log n);

Now for 7th smallest element, we need 7 such operations, hence O(7 log n) = O(log n)

For 2nd one :

O(n)
answered by Loyal (3.8k points)  
good algorithm!!

i wasn't aware of such a solution. thanks!!

@kapilp

are you sure for first one it is O(logn)

If we will go with simple procedure like 1+2+3+....2^n-1 comaprison to find nth smallest element then it is O(1)

another one is start deleting the element till kth level to reach the kth smallest element which is O(logn)

because everywhere I am seeing O(1) as well O(logn) time...can u plz confirm?? even I am bit confuse

see this:

http://gateoverflow.in/5915/complexity-finding-smallest-element-already-constructed

http://stackoverflow.com/questions/21600312/searching-the-7th-largest-element-in-a-max-heap

 

@cse23, yes, it is O(1).

and for 2nd it is O(N).
ok fine...so to find kth smallest element from the min heap..we can do in O(1) time.
yes..


Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2104 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1336 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1186 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,446 questions
26,759 answers
60,943 comments
22,955 users