Search results
- Computer Programming, vol. 3 (Second ed.), Addison-Wesley, p. 402, ISBN 978-0-201-89685-5 McCabe, John (1965), "On Serial Files with Relocatable Records", Operations...5 KB (648 words) - 20:04, 19 July 2024
- Sorting and Searching (2nd ed.). Addison-Wesley. pp. 513–558. ISBN 978-0-201-89685-5. [verification needed] Wang, Thomas (March 1997). "Prime Double Hash...2 KB (102 words) - 17:58, 21 August 2021
- Vol. 3 (2nd ed.). Reading, MA: Addison-Wesley Professional. ISBN 978-0-201-89685-5. Munro, J.Ian; Suwanda, Hendra (October 1980). "Implicit data structures...8 KB (1,096 words) - 21:18, 5 February 2024
- Art of Computer Programming. Vol. 3 (2 ed.). Addison Wesley. ISBN 978-0-201-89685-5. The 2–3 trees defined at the close of Section 6.2.3 are equivalent...8 KB (1,216 words) - 07:13, 25 September 2024
(2nd ed.). Reading, Massachusetts: Addison-Wesley. pp. 83–95. ISBN 978-0-201-89685-5. Shell, D. L. (1959). "A High-Speed Sorting Procedure" (PDF). Communications...33 KB (3,436 words) - 06:53, 17 May 2024
Sorting and Searching (2nd ed.). Addison-Wesley. pp. 513–558. ISBN 978-0-201-89685-5. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein...52 KB (5,873 words) - 15:26, 12 November 2024- Computer Programming. Vol. 3 (2nd ed.). Addison-Wesley. p. 432. ISBN 978-0-201-89685-5. Sedgewick, Robert; Wayne, Kevin (2011). Algorithms (4th ed.). Addison-Wesley...5 KB (412 words) - 22:06, 20 October 2024
Sorting and Searching (Second ed.). Addison–Wesley. pp. 219–247. ISBN 978-0-201-89685-5. Section 5.3.4: Networks for Sorting. US 3029413, O'Connor, Daniel...21 KB (2,159 words) - 00:11, 28 October 2024
searching. USA: Addison Wesley Longman Publishing Co., Inc. ISBN 978-0-201-89685-5. Donald Knuth. The Art of Computer Programming, Volume 3: Sorting...21 KB (2,674 words) - 12:54, 4 January 2024
(Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout. ISBN 978-0-201-89685-5, 0-201-89685-0. Errata: [7] (2011-01-08), [8] (2022, 45th printing)...34 KB (3,782 words) - 04:27, 26 November 2024- USA: Addison Wesley Longman Publishing Co., Inc. pp. 536–549. ISBN 978-0-201-89685-5. Knuth, Donald (1963), Notes on "Open" Addressing, archived from the...32 KB (4,173 words) - 21:10, 30 March 2024
newly updated and rev. ed.). Boston [u.a.]: Addison-Wesley. ISBN 978-0-201-89685-5. Look up hash in Wiktionary, the free dictionary. Calculate hash of...50 KB (7,459 words) - 21:35, 24 November 2024
Sorting and Searching (3rd ed.). Addison-Wesley. pp. 144–155. ISBN 978-0-201-89685-5. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein...50 KB (5,789 words) - 19:29, 20 October 2024
Sorting and Searching (2nd ed.). Addison-Wesley Professional. ISBN 978-0-201-89685-5. ——— (2011). The Art of Computer Programming. Vol. 4A: Combinatorial...68 KB (6,199 words) - 16:23, 26 November 2024
The Art of Computer Programming. Vol. 3 (2 ed.). Addison Wesley. ISBN 9780201896855. The 2–3 trees defined at the close of Section 6.2.3 are equivalent...31 KB (3,098 words) - 02:00, 13 November 2024- — 2. — Addison-Wesley, 1998. — Т. 3. — С. 212–247. — 780 с. — ISBN 9780201896855. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford...11 KB (1,303 words) - 07:11, 13 September 2024
- 3: Sorting and Searching (2nd ed.). Addison-Wesley. p. 547. ISBN 978-0-201-89685-5. "The NT Insider:Kernel-Mode Basics: Windows Linked Lists". Archived...55 KB (7,792 words) - 09:47, 19 October 2024
Vol. 3 (2nd ed.). Reading, MA: Addison-Wesley Professional. ISBN 978-0-201-89685-5. Knuth, Donald (2011). Combinatorial algorithms. The Art of Computer...74 KB (9,632 words) - 17:33, 10 October 2024
The Art of Computer Programming, Reading, MA: Addison-Wesley, ISBN 978-0-201-89685-5, section 6.2.1, pp. 409–26 Donald Knuth 1998, section 5.2.4, pp. 158–68...98 KB (11,600 words) - 14:09, 18 November 2024
of Computer Programming, vol. 3 (Second ed.), Addison–Wesley, ISBN 978-0-201-89685-5. Section 5.1: Combinatorial Properties of Permutations, pp. 11–72...78 KB (11,547 words) - 23:08, 24 November 2024
