On Fri, Feb 5, 2016 at 8:12 PM, Sven R. Kunze <srku...@mail.de> wrote: > On 05.02.2016 02:26, srinivas devaki wrote: > What do you think about our use-case? > Oh, the logic is sound, every element that we have inserted has to be popped, We are spending some *extra* time in rearranging the elements only to be sure that we won't be spending more than this *extra* time when doing other operations, and our use-case isn't much different either, If by rearranging the elements in the heap(*subheap*) gets optimal for other operations like popping the root element(heap[0]) then obviously it is optimal for popping other elements (children of heap[0]).
PS: @sven But don't yet merge the pull request, I could be wrong. as the heapq module already says that the variance is very small, let me write some tests(on more than 10**3 elements) and then get back here. -- Regards 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 -- https://mail.python.org/mailman/listinfo/python-list
