Only comparison-based sorting is bound by O(n log n). Non-comparison based sorts... | Hacker News

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

comparison on Dec 1, 2014 | parent | context | favorite | on: A New Software Engineering

Only comparison-based sorting is bound by O(n log n). Non-comparison based sorts can do better.

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