Radix sort operates in O ( n w ) {\displaystyle O(nw)} time, where n {\displaystyle n} is the number of keys, and w {\displaystyle w} is the key length. LSD variants can achieve a lower bound for w {\displaystyle w} of 'average key length' when splitting variable length keys into groups as discussed above.