[REBOL] Re: REP: Introduce new functions for finding minimum and maximum of a se
From: g::santilli::tiscalinet::it at: 26-Dec-2000 13:02
Hello Petr!
On 26-Dic-00, you wrote:
PK> What really surprised me, is a level in which the
PK> functionality is solved - native. In my opinion, for
It is faster this way. And it IS useful!
PK> 'sort. Ladislav Mecir suggested me to use iteration though,
PK> and I would never believe iteration could be faster than
PK> native 'sort. Let's look in a real-life examples:
It's quite normal it is. Finding the max/min is O(n), while sorting
is O(n*log(n)).
PK> Lack of support of such relatively primitive functionality
PK> led me to conclusion to submit this proposal:
They're quite easy to do as mezzanine, but maybe a native would be
the best choice...
Regards,
Gabriele.
--
Gabriele Santilli <[giesse--writeme--com]> - Amigan - REBOL programmer
Amiga Group Italia sez. L'Aquila -- http://www.amyresource.it/AGI/
