Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8156409 commit fc8408cCopy full SHA for fc8408c
1 file changed
Doc/library/heapq.rst
@@ -203,9 +203,6 @@ entry as invalid and optionally add a new entry with the revised priority::
203
Theory
204
------
205
206
-(This explanation is due to François Pinard. The Python code for this module
207
-was contributed by Kevin O'Connor.)
208
-
209
Heaps are arrays for which ``a[k] <= a[2*k+1]`` and ``a[k] <= a[2*k+2]`` for all
210
*k*, counting elements from 0. For the sake of comparison, non-existing
211
elements are considered to be infinite. The interesting property of a heap is
0 commit comments