Skip to content

C
cpython
Kaydet (Commit) fc8408cb authored tarafından Benjamin Peterson's avatar Benjamin Peterson
Dosyalara gözat
Seçenekler

remove author names from prose

üst 81564093
Hide whitespace changes
Inline Side-by-side
Showing with 0 additions and 3 deletions
Doc/library/heapq.rst
Dosyayı görüntüle @ fc8408cb
...@@ -203,9 +203,6 @@ entry as invalid and optionally add a new entry with the revised priority:: ...@@ -203,9 +203,6 @@ entry as invalid and optionally add a new entry with the revised priority::
Theory Theory
------ ------
(This explanation is due to François Pinard. The Python code for this module
was contributed by Kevin O'Connor.)
Heaps are arrays for which ``a[k] <= a[2*k+1]`` and ``a[k] <= a[2*k+2]`` for all Heaps are arrays for which ``a[k] <= a[2*k+1]`` and ``a[k] <= a[2*k+2]`` for all
*k*, counting elements from 0. For the sake of comparison, non-existing *k*, counting elements from 0. For the sake of comparison, non-existing
elements are considered to be infinite. The interesting property of a heap is elements are considered to be infinite. The interesting property of a heap is
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment