CS61B Textbook Fall 2026
⌘Ctrlk
GitBook Assistant
GitBook Assistant
GitBook Assistant

I'm here to help you with the docs.

⌘Ctrli
AI Based on your context
CS61B Textbook Fall 2026
  • Fall 2026 Textbook
  • Contributors
  • DISCLAIMER
  • 1. Introduction
  • 2. Defining and Using Classes
  • 3. References, Recursion, and Lists
  • 4. IntLists
  • 5. Testing
  • 6. SLLists
  • 7. DLLists and Arrays
  • 8. Resizing ArrayList
  • 9. Inheritance I: Interface and Implementation Inheritance
  • 10. Inheritance II: Subtype Polymorphism, Comparators, Comparables, Generic Functions
  • 11. Inheritance III: Iterators, Object Methods
  • 12. Asymptotics I
  • 13. Asymptotics II
  • 14. Asymptotics III
  • 15. Disjoint Sets
  • 16. Binary Search Trees
  • 17. B-Trees
  • 18. Red Black Trees
  • 19. Heaps and Priority Queues
  • 20. Tree Traversals and Graphs
  • 21. Graph Traversals and Implementations
  • 22. Shortest Paths
  • 23. Minimum Spanning Trees
  • 24. Reductions and Decomposition
  • 25. Hashing I
    • 25.1 Introduction to Hashing: Data Indexed Arrays
    • 25.2 Hash Code
    • 25.3 "Valid" & "Good" Hashcodes
    • 25.4 Handling Collisions: Linear Probing and External Chaining
    • 25.5 Resizing & Hash Table Performance
    • 25.6 Summary
    • 25.7 Exercises
  • 26. Hashing II
  • 27. Prefix Operations and Tries
  • 28. Software Engineering I
  • 29. Software Engineering II
  • 30. Basic Sorts
  • 31. Quicksort
  • 32. More Quick Sort, Sorting Summary
  • 33. Sorting and Algorithmic Bounds
  • 34. Radix Sorts
  • 35. Sorting and Data Structures Conclusion
  • 36. Software Engineering III
  • 37. Software Engineering IV
  • 38. Compression and Complexity
  • 39. Compression, Complexity, P = NP
Powered by GitBook
For the complete documentation index, see llms.txt. This page is also available as Markdown.

25. Hashing I

By William Lee and Angel Aldaco

25.1 Introduction to Hashing: Data Indexed Arrays25.2 Hash Code25.3 "Valid" & "Good" Hashcodes25.4 Handling Collisions: Linear Probing and External Chaining25.5 Resizing & Hash Table Performance25.6 Summary25.7 Exercises
Previous24.5 Exercises
Next25.1 Introduction to Hashing: Data Indexed Arrays

Last updated 4 days ago

Was this helpful?

Was this helpful?