Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Engineering LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Author
    • Set as Cover Page of Book
    • License
    • Show TOC
    • Transcluded
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
  • Include attachments
Searching in
About 1 results
  • 5.3: Hash Codes
    https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/05%3A_Hash_Tables/5.03%3A_Hash_Codes
    By Theorem \(\PageIndex{1}\), if \(h'(\mathtt{x}_0,\ldots,\mathtt{x}_{r-1})\neq h'(\mathtt{y}_0,\ldots,\mathtt{y}_{r-1})\), then \(\Pr\{h(\mathtt{x}_0,\ldots,\mathtt{x}_{r-1}) = h(\mathtt{y}_0,\ldots,...By Theorem \(\PageIndex{1}\), if \(h'(\mathtt{x}_0,\ldots,\mathtt{x}_{r-1})\neq h'(\mathtt{y}_0,\ldots,\mathtt{y}_{r-1})\), then \(\Pr\{h(\mathtt{x}_0,\ldots,\mathtt{x}_{r-1}) = h(\mathtt{y}_0,\ldots,\mathtt{y}_{r-1})\} \le 2/2^{\mathtt{w}}\).

Support Center

How can we help?