As part of an assignment for my OS class I need to implement a heap which stores the smallest value at the root with arrays.
I suppose it would need the following methods, insert() , pop(), resize() at a minimum. Could anyone give me some advice on the subject. The heap will store an array of data which I have already defined in another struct by the way.
Any help would be appreciated,