"Q ka rishton m piyar khtm ho gaya h ap kisi pa trust karo expectation rkho wo ap ko 2bl kr jae
Will is more powerful than mind jis bnda ka pass mind ho wo hypocrite hota h,
life is creating ur self
hum es liya pasti ki trf ja raha hain ka hum…"
"
Outline of Procedure Heapify
Heapify picks the largest child key and compare it to the parent key. If parent key is larger than heapify quits, otherwise it swaps the parent key with the largest child key. So that the parent is…"
"Question 2:Suppose that the splits at every level of quicksort are in the proportion 1 - α to α, where 0 /span> α which is ≤ 1/2 is a constant. Show that the minimum depth of a leaf in the recursion tree is approximately - lg…"
"Question 1:Show that the worst-case running time of MAX-HEAPIFY on a heap of size n is Ω (lg n).
solution:
Consider a cheap of n nodes where the root node has been changed to contain the smallest value of all the nodes. Now when we call…"