Log In

Recent posts tagged test-series

It is long as number is independent of n it can be found with k×k-1/2 Comparisons. The 50 th smallest element must be within first 50 levels of minheap. for first min :0 comp(root itself) For second min: 0(first min) +1 comp(at level 2) =1 For ... =0+1+2...+49= 49*50/2=1225 Comparisons which is constant We need not delete the elements in which case the complexity will be 50 logn
posted Dec 28, 2018 in Preparation Advice Shaik Masthan 6,041 views
To see more, click for the full list of questions or popular tags.