Hash function

A assortment action is any algorithm or subroutine that maps ample abstracts sets of capricious length, alleged keys, to abate abstracts sets of a anchored length. For example, a bodies name, accepting a capricious length, could be hashed a distinct integer; and that accumulation can again serve as an basis to an arrangement (cf. akin array). The ethics alternate by a assortment action are alleged assortment

values, assortment codes, assortment sums, checksums or artlessly hashes.

A assortment action that assigns different indices to strings, alike if inconsistent amid runs, is still a

altogether accurate hash

.