Heap Implementation

srinivas devaki mr.eightnoteight at gmail.com
Tue Feb 9 20:27:14 EST 2016

On Feb 10, 2016 6:11 AM, "Cem Karan" <cfkaran2 at gmail.com> wrote:
> Eh, its not too bad once you figure out how to do it.  It's easier in C
though; you can use pointer tricks that let you find the element in
constant time, and then removal will involve figuring out how to fix up
your heap after you've removed the element.

If you can do it with C pointers then you can do it with python's
references/mutable objects. :)
in case of immutable objects, use a light mutable wrapper or better use
list for performance.

Srinivas Devaki
Junior (3rd yr) student at Indian School of Mines,(IIT Dhanbad)
Computer Science and Engineering Department
ph: +91 9491 383 249
telegram_id: @eightnoteight

More information about the Python-list mailing list