2010/12/4 ankit sablok <ankit4...@gmail.com>: > as all the elements are sorted in the array make a min heap of the > array elements and as min heap is a tree of keys querying a min heap > or a binary search tree requires operations with time equal to the > height of the tree which is log(n) hence time for querying a min heap I think you might be use a log(n) time to find out a element whose value is equal to some certain index, so the complexity could be n*log(n)?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
