# Thread: Building a heap in Design and analysis of algorithms free notes

### The UPDATE Statement

The UPDATE statement is used to update existing records in a table. Read this topic
1. ## Building a heap in Design and analysis of algorithms free notes

We can use the procedure MAX-HEAPIFY in a bottom-up manner to convert an array A[1 ‥n], where n = length[A], into a max-heap, the elements in the subarray A[(⌊n/2⌋ 1) ‥n] are all leaves of the tree, and so each is a 1-element heap to begin with. The procedure BUILD-MAX-HEAP goes through the remaining nodes of the tree and runs MAX-HEAPIFY on each one. BUILD-MAX-HEAP(A)

2. ## Re: Building a heap in Design and analysis of algorithms free notes

gud notes..........monica ji...thnx

3. ## Re: Building a heap in Design and analysis of algorithms free notes

thanks for sharing...

4. ## Re: Building a heap in Design and analysis of algorithms free notes

we can also see that like

5. ## Re: Building a heap in Design and analysis of algorithms free notes

Originally Posted by monica.4567
We can use the procedure MAX-HEAPIFY in a bottom-up manner to convert an array A[1 ‥n], where n = length[A], into a max-heap, the elements in the subarray A[(⌊n/2⌋ 1) ‥n] are all leaves of the tree, and so each is a 1-element heap to begin with. The procedure BUILD-MAX-HEAP goes through the remaining nodes of the tree and runs MAX-HEAPIFY on each one. BUILD-MAX-HEAP(A)

Great! Am having some trouble in understanding an algorithm I was going through. Can I post it here to get some clarity on the same?

6. ## Re: Building a heap in Design and analysis of algorithms free notes

download doesnot works in my android device. any dea .......?

7. ## Re: Building a heap in Design and analysis of algorithms free notes

[MENTION=206079]ashok061[/MENTION]: you will need to register again, you account is inactive