We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
what makes you think its faster? my understanding is that the performance should be very similar. see for example: https://wiki.python.org/moin/TimeComplexity. also your item_lookup will grow without bound as you add and delete items since nothing is ever actually deleted.
QHEAP1
You are viewing a single comment's thread. Return to all comments →
what makes you think its faster? my understanding is that the performance should be very similar. see for example: https://wiki.python.org/moin/TimeComplexity. also your item_lookup will grow without bound as you add and delete items since nothing is ever actually deleted.