Typically, it is assumed that w ≥ log2(max(n, K)); that is, that machine words are large enough to represent an index into the sequence of input data, and also large enough to represent a single key.
Tipično, pretpostavlja se da je w ≥ log2(max(n, K)); to jest, da je mašinski jezik dovoljno veliki da predstavi indeks u nizu ulaznih podataka i da je dovoljno veliki da predstavi samostalan ključ.