News for hackers. Stuff that matters.

A comment on I can’t believe that I can prove that it can sort. Parent comment

Re:I can’t believe that I can prove that it can sort by yannickmoy on Monday July 04, 2022 @02:06PM (#31980087)
For a related eye-opening result, with both practical application and interesting research backing it, see this talk on "Quicksorts of the 21st century" at Newton Institute on Verified Software last year: https://www.newton.ac.uk/seminar/30504/

TLDR; practical complexity computation needs to take into account things like memory access latency on different architectures.

[ Parent | on HN ]

There are no comments on this comment yet.