Re: [Gretl-users] Julia Micro-Benchmarks
Am 26.02.2018 um 20:09 schrieb Riccardo (Jack) Lucchetti:
On Mon, 26 Feb 2018, Sven Schreiber wrote:
> Perhaps the only thing where I'd like to know more is the
> "recursion_quicksort" kind of thing. (Haven't really looked at the
> code yet.) In particular, is there some built-in gretl function that
> would normally be used for this kind of task instead of writing a
> home-cooked hansl function?
Yes. The quicksort algorithm is precisely what we use internally for all
sorting, such as for example msortby().
Aha, that's what I suspected (hoped). That's the problem with micro
benchmarks: Of course it's also good to know how hansl should _not_ be
used, but the slowness in this benchmark then doesn't tell you anything
about how useful hansl is for a real-world sorting problem - because you
would simply call sort/dsort/msortby and be done, and much faster.
thanks,
sven