This is a nice technique in theory, but in practice it isn't so fast, mainly bec... | Hacker News

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

		jules on Aug 24, 2017 \| parent \| context \| favorite \| on: Ask HN: What is your favorite CS paper? This is a nice technique in theory, but in practice it isn't so fast, mainly because of the implementation details. Radix sort is actually faster than comparison sorts if implemented well.

KirinDave on Aug 25, 2017 [–]

Do you have benchmarks of Kmett's Implementation? I'm very curious.

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