Re: Fasctode - Sort estimating complexity and B&V

Avatar Zondertau wrote:

> Basically what you're trying to say is, that if anyone submits a
> braindead O(N^2) (or worse) implementation, this will be a problem for
> the benchmark because it will run for too long?

Basically, I have tinking on solving worst case problem for original QuickSort
inside B&V and this may be global solutions.

By logic of competition, "braindead" are all functions slower than RTL - that
is how I see things. By Dennis words (IntToStr competition) that is
not explicit rule. And by that, all (even Bubble and original QuickSort)
functions are allowed, which mean that B&V should be capable to handle it
by default.

Sasa
--
www.szutils.net
.