News for hackers. Stuff that matters.

A comment on FreeBSD replaces bubblesort with mergesort on SYSINTs, results in 100x speed. Parent comment

Re:FreeBSD replaces bubblesort with mergesort on SYSINTs, re... by Closi on Monday August 21, 2023 @07:47AM (#37208197)
> the only valid values for collection sizes are 0 and N -> āˆž.

Of course there are valid values below that...

If they were designing to a collection size of N -> āˆž then they shouldn't have used Insertion Sort either then, because it is O(nĀ²) in the worst case.

[ Parent | on HN ]
Re:FreeBSD replaces bubblesort with mergesort on SYSINTs, re... by oblio on Monday August 21, 2023 @07:50AM (#37208222)
True, but make that valid value at least something like 1 million.

It's trivial to start with something that gets human input and someone, somewhere, decides to plug the thing into something else that generates that input.

And we all know that if computers are good at something, it's doing a lot of small things millions of times.

[ Parent | on HN ]