A better comparison is bucket sort which is O(N) with uniformly distributed keys... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

nwellnhof 9 months ago | parent | context | favorite | on: Calendar Queues: A Fast O(1) Priority Queue Implem...

A better comparison is bucket sort which is O(N) with uniformly distributed keys.

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