FB13 slower than FB11?

[Dean]

I just tried running those quicksorts that were the subject
of the SORTING ARRAYS thread in FB13 -- and I'm consistently
getting 21% slower performance with FB13 over FB11.
Exact same code.

Please, tell me that there's some compile options that I should
use for optimization, or something, please -- we can't get
slower as we go.

Dean

[wallace]

Use a Heap Sort, its even faster than Quicksort (n lg n vs. n lg n -> n^2)

[v3cz0r]

Well, the only way to sort 3 million strings faster is using different algorithms, if you don't want to consider the use of C rtlib's qsort(), then i don't know what else will work..

Compiler actually does more optimizations now, and the string copy and compare functions were changed to assembly ones, using the x86's repeat instructions -- before they were C loops.

[wildcard]

I'm locking this thread as its a duplicate of [url]http://forum.qbasicnews.com/viewtopic.php?t=9305[url] - which has more posts/info.