> If the keys are not too long, radix sort is O(n) and faster. More precisely, i...

		guyomes on June 7, 2023 \| parent \| context \| favorite \| on: Deepmind Alphadev: Faster sorting algorithms disco... > If the keys are not too long, radix sort is O(n) and faster. More precisely, if the key length is w, then radix sort is O(w n) operations. In particular, if the n elements are distinct integers for example, w is greater than log(n).