lec0408-Hashing2 - Announcements: MP 6 available. Due 4/15,...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Announcements: MP 6 available. Due 4/15, 11:59p. No sections this week. Today: More Hashing A Hash Table consists of: 1.An array 2.A hash function 3.A collision resolution strategy Hashing Strings (an example) Given: 8 character strings are easy to hash The idea: Select 8 random positions from long strings and hash that substring. A bunch of strings: Lookyhere, Huck, being rich ain't going No! Oh, good-licks; are you in real dead Just as dead earnest as I'm sitting here nto the gang if you ain't respectable, y Can't let me in, Tom? Didn't you let me Yes, but that's different. A robber is m irate is -- as a general thing. In most Now, Tom, hain't you always ben friendly ut, would you, Tom? You wouldn't do that Huck, I wouldn't want to, and I DON'T wa ay? Why, they'd say, 'Mph! Tom Sawyer's t!' They'd mean you, Huck. You wouldn't uck was silent for some time, engaged in Well, I'll go back to the widder for a m can come to stand it, if you'll let me All right, Huck, it's a whiz! Come along All right, Huck, it's a whiz!...
View Full Document

This note was uploaded on 01/26/2012 for the course CS CS 225 taught by Professor Heeren during the Spring '09 term at University of Illinois, Urbana Champaign.

Page1 / 12

lec0408-Hashing2 - Announcements: MP 6 available. Due 4/15,...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online