Heap sort gets beat by sorting algorithms with better locality. You can't be the... | Hacker News

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

		CyberDildonics on June 7, 2023 \| parent \| context \| favorite \| on: Deepmind Alphadev: Faster sorting algorithms disco... Heap sort gets beat by sorting algorithms with better locality. You can't be the fastest while skipping through memory for every operation.

janwas on June 8, 2023 [–]

Agreed. And I am not aware of a heapsort that can take advantage of SIMD, so our not very well-tuned heapsort is about 20 times slower in practice than our VQSort (vectorized quicksort).

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