User-developed array-based hash routines had been used in SAS since 1998. In 2003, they quickly took a back seat to the newly-fangled SAS hash object, and nowadays many SAS programmers may not have even heard of them. This is a typical case of throwing the baby out with the bathwater, as under a number of scenarios, array-based hashing is both faster and easier on RAM. Unfortunately, the code behind it has somehow gained the reputation of being exceedingly complex. In this talk, we will try to dispel this myth using a simple data example coupled with the simplest (and yet fully practical) hashing scheme called open addressing with linear probing.