Open Data Structures: An Introduction by Pat Morin (2013, 9781927356388)

By Pat Morin.

Publisher: Athabasca University Press (parent print book).

Publication information: www.aupress.ca/books/120226-open-data-structures/

Online text: opendatastructures.org/ods-python/5_2_LinearHashTable_Linear_.html

Section of Open Data Structures: An Introduction by Pat Morin, whose whole-book author is Pat Morin. The online Python edition is undated; 2013 in the parent record is the print-book publication year.

Cited passages: §5.2, opening description of direct slot storage and consecutive modular probing; three entry types and counters n and q; find, add, remove and correctness paragraphs distinguishing del from nil; resize and resetting q to n.

Online text: opendatastructures.org/ods-python/5_1_ChainedHashTable_Hashin.html

Cited passages: Open Data Structures, section 5.1, the array of lists and the find/remove operations.

Additional cited passages: §5.1.1, multiplicative hashing construction and Lemma 5.1; indicator-variable proof of Lemma 5.2. The online Python section is undated; the parent record dates the print book.

Online text: opendatastructures.org/ods-python/11_1_Comparison_Based_Sorti.html

Cited passages: Open Data Structures, section 11.1.4, Theorem 11.5: deterministic comparison-tree lower bound.

Online text: opendatastructures.org/ods-python/11_2_Counting_Sort_Radix_So.html

Cited passages: Open Data Structures, section 11.2.1: associated data, backwards placement, Theorem 11.7 and stability; Open Data Structures, section 11.2.2: least-significant-digit passes, stability argument, and Theorem 11.8.

Online text: opendatastructures.org/newhtml/ods/latex2/binarytrees.html

Cited passages: Pat Morin, Open Data Structures, chapter 6: roots, left and right children; Pat Morin, Open Data Structures, section 6.2.1: exact-match searching; Pat Morin, Open Data Structures, section 6.2: the binary search tree property.