Max Priority queue based on max-heap

Question

I am trying to implement the MAX-HEAP-INSERT(A,key) function. It's pseudocode is:

MAX-HEAP-INSERT(A,key) 1 A.heap-size = A.heap-size+1 2 A[A.heap-size] = -inf 3 HEAP-INCREASE-KEY(A,A.heap-size,key)

Where HEAP-INCREASE-KEY(A,A.heap-size,key) is another function which i didn't have trouble understanding.

The heap is based on an array A, and as we know arrays are limited. So, when we increase the A.heap-size won't there be a problem when A.heap-size gets bigger than A.length?

Will · Accepted Answer · 2013-07-03 13:46:28Z

1

Yes. If this happens you have to increase the size of your array.

answered Jul 3, 2013 at 13:46

Will

76k43 gold badges177 silver badges256 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Max Priority queue based on max-heap

1 Answer 1

Comments

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Related