Question: In class, we discussed implementing a binary heap as an array. When the heap fills, assume you double the size of the array and copy
In class, we discussed implementing a binary heap as an array. When the heap fills, assume you double the size of the array and copy the elements into the new array. Assume that copying n elements is O(n). Starting with an initial array size of 1, what is the amortized cost of inserting M elements into your heap?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
