Computer Science, asked by gulafsha3939, 1 year ago

Prove that for binary heap build heap does at most 2n2 comparisons between elements

Answers

Answered by choudhary21
22

Explanation:

Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. Steps to implement Quick sort:

1) Choose an element, called pivot, from the list.

Answered by Anonymous
2

Explanation:

<body bgcolor = "black"> <font color ="red"><font size="50">

 <marquee> Answer bhai ne de rkha h

Similar questions