Re: Fasctode - Sort estimating complexity and B&V
- From: "Anders Isaksson" <blockcad@xxxxxxxxxxxxxxx>
- Date: Mon, 10 Oct 2005 21:15:37 +0200
Sasa Zeman wrote:
>
> Estimating complexity and needed time for N elements according
> upper measurments we can stop original worst case sequence
> for any algorithm if it eventually have quadratic complexity,
> since any algorithm is allowed to challange (even Bubble).
I really don't think this is a problem. If you develop a sort algorithm for
the challenge, you will surely test it in the B&V before publishing. After
waiting one hour for the results, I think most of us would realize that we
have not stumbled upon a winner, and wouldn't bother to send it in.
The next screening step is the person running the official benchmarks. After
waiting forever for a result, he/she would probably pull the offending entry
from the competition (rightly so). Just look at all reports Dennis has
supplied about entries in all the competitions.
Of course, a person could always send a lot of ill-behaved entries just to
sabotage the competition, but I think that person would quickly be pulled
too...
--
Anders Isaksson, Sweden
BlockCAD: http://web.telia.com/~u16122508/proglego.htm
Gallery: http://web.telia.com/~u16122508/gallery/index.htm
.
- Follow-Ups:
- Re: Fasctode - Sort estimating complexity and B&V
- From: Sasa Zeman
- Re: Fasctode - Sort estimating complexity and B&V
- References:
- Fasctode - Sort estimating complexity and B&V
- From: Sasa Zeman
- Fasctode - Sort estimating complexity and B&V
- Prev by Date: Re: FastCode RTL Replacement v0.20 Released!
- Next by Date: Re: FastcodeCompareStr B&V 2.1
- Previous by thread: Re: Fasctode - Sort estimating complexity and B&V
- Next by thread: Re: Fasctode - Sort estimating complexity and B&V
- Index(es):
Relevant Pages
|