These solutions do not scale at all. Even with tweaks, they could not sort 18 ni... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		ploxiln on July 21, 2015 \| parent \| context \| favorite \| on: Nibble Sort These solutions do not scale at all. Even with tweaks, they could not sort 18 nibbles (or 32 nibbles). But they are very interesting, and these kinds of tricks do find some practical use in things like video codecs.

dragontamer on July 21, 2015 [–]

But they can sort 16 nibbles twice, and then you can use merge-sort between the two sets of nibbles.

Which would scale at O(n*log(n)). Which is asymptotically optimal IIRC.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact