Re: Fasctode - Sort estimating complexity and B&V

Anders Isaksson wrote:

> 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.

You have vote for that to deliberatly creating worst-case sequence
for any quicksort version or any other function (if exist)? That
mean plus at least 2-4 additional benchmarks which will be
executed and measurest by all algorithm.

What is your proposal how to solve this? I.e., for one algorithm
one sequence can be worst case, but not for other except
decreasing N to K (where K is ammount of elements for reasonable
execution time) for these sequences. That also mean changed
distibution of elements. Etc...

And second issue:

Still there is no exact answer from Avatar or any of who vote for
that how exact weigthing of time for these sequences and what
effect will be on total result...

All in all, specificly this voting are prematures without
previously known exact all the facts. And number of
voters are too small (only 7?). Since this will eventually
be a Borland function, why someone from Borland isn't
involoved to be arbitrer and who create rules istead of
only 7 peoples decide what is important? And ironically,
one vote is crucial..

If someone in Borlind decide to put "middle elemen pivot"
that was a background of milions of users practice before.

Again, I haven't aware that someone complaint that RTL
sort ever eneter in O(N*N).

In that all is the case, why is stil very important
deliberately/specially creating of worst-case sequences?

And thisd issue:

What is a base of decision that target benchmark ammount
of items be a 2^22 except to see efect on maximum limit
size items who never used in practice? I do not know
anyone who ever use even more than 2^14 items in Tlist.
Some algorithmms better work on such small ammount of
data instead on 2^22... Someone from Borland can gives
better explanation than voting of 7 peoples...

Etc, etc... Many important issues are still open
and have no rational/real answers. Of cours, I can
speak only by my own more than 15 years experience,
but hardly that one man can have all correct answers
in hands.

Sasa
--
www.szutils.net
.

Relevant Pages

  • "Algorithmic Randomness, Quantum Physics, and Incompleteness"
    ... all finite sequences are to be found infinitely often and ... different members of the infinite set of random numbers. ... Just using random numbers with initial digits 1 thru 9, ... it generated by a shorter input algorithm than the length ...
    (sci.logic)
  • Re: compression - insights into infinite
    ... output sequences, your technology isn't reversible, plain and simple. ... For that, it needs an algorithm. ... Not very convenient for a compressor, ... he notice but he also remembers his promises, and I assure you, you ...
    (comp.compression)
  • Re: compression - insights into infinite
    ... output sequences, your technology isn't reversible, plain and simple. ... For that, it needs an algorithm. ... OUTPUT cell, residue, part A. The problem with this was that some ... Not very convenient for a compressor, ...
    (comp.compression)
  • Re: compression - insights into infinite
    ... output sequences, your technology isn't reversible, plain and simple. ... I'd suggest that maybe I'm measuring something erroneously or ... For that, it needs an algorithm. ... Not very convenient for a compressor, ...
    (comp.compression)
  • Re: Unshuffle algorithm
    ... I have an array of numbers made up of two sequences that ... extract separate arrays made up of these sequences. ... that had been converted to flat images without metadata. ... algorithm, but thanks very much for your interest. ...
    (comp.soft-sys.matlab)