|
CITIDEL >
Planet Math Computer Science >
Planet Math Computer Science Collection >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10117/1201
|
| Title: | hashing |
| Issue Date: | 28-Feb-2005 |
| Publisher: | PlanetMath |
| Citation: | http://planetmath.org/encyclopedia/Hashing.html |
| Abstract: | ... Hashing refers to an information storage and retrieval technique which is very widely used in real-world applications. There many more potential places it could profitably be applied as well. In fact, some programming languages these days (such as Perl) are designed with hashing built-in, so the programmer does not even have to know about them (or know much about them) to benefit. Hashing is inspired by both the classical searching and sorting problems. We know that with comparison-based sorting, the quickest we can put a set of n items in lexicographic order is ... . We can then update the sorted structure with new values either by clumsy reallocations of memory and shifting of elements, or by maintaining list structures. Searching for an item in a sorted set of |
| URI: | http://www.citidel.org/handle/10117/1201 |
| Appears in Collections: | Planet Math Computer Science Collection
|
Files in This Item:
| File |
Size | Format |
|---|
| Hashing.html | 50Kb | HTML | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
Computing and Information Technology Interactive Digital Educational Library