https://benchmarksgame-team.pages.debian.net/benchmarksgame/fastest/gnat-rust.html

]]>Will update this post with new builds soon. ]]>

That is good, right and OK. MergeSort can GUARANTEE, that its

complexity is O(n*log(n)) in the worst case. And that is not true for

QuickSort. In QuickSort you have to find a “good pivot element”.

How do you do this? Preferably with a Merge sort. What I want to say is,

that finding a “good pivot element” is harder to understand than a complete

MergSort. More than once, I experienced that my Computer was “hit by an

lightning”, and because of this, the QuickSort comes from O(n*log(n)) to

O(n^2) (e.g. Sorting of only same items)

OK, I never programmed a QuickSort, but I programmed a MergeSort,

which sorts 1,000,000,000 (1 Billion) lines in less than 3 hours. And it does

this on the Harddisk, not in RAM. And during this time, you can also do

fluently other work on this (Windows-)PC. ]]>

-“&” with “&”

– “>” with “>”

– “<” with “<"

It will run correctly once that's done. ]]>