With both the DATA step
and DS2, note the size of the key. A recent program carried out many
hash lookups with a 356-byte key. Hashing is an O(1) algorithm; the
"1" with the hash package is the length of the key. The
longer the key, the longer the hash function takes to operate.
dcl char(200) k1 k2;
dcl double d1 d2;
/* If k1 and k2 are always smaller than 200, then */
/* size them smaller to reduce the time spent in */
/* the hash function when adding and finding values */
/* in the hash package. */
dcl package hash([k1 k2], [d1 d2]);