In Summary
•For many applications, hashing provides the most efficient way to use an ADT Table.
•But, you should be aware that hashing IS NOT designed to support traversing an entire table of items and have them appear in sorted order.
•Notice that a hash function scatters items randomly throughout the table...so that there is no ordering relationship between search keys and adjacent items in the table