7 hours ago, Harry Spier wrote:
> On Sun, Jul 29, 2012 at 6:12 PM, Eli Barzilay wrote:
>
> > Actually, the `sort' code uses a vector to do its work, which is
> > initialized from the input list. But it doesn't help much to make it
> > deal with vectors too, since the vector that is used for the
On Sun, Jul 29, 2012 at 6:12 PM, Eli Barzilay wrote:
> Actually, the `sort' code uses a vector to do its work, which is
> initialized from the input list. But it doesn't help much to make it
> deal with vectors too, since the vector that is used for the sorting
> work needs to be bigger than the
Also:
(require data/heap)
heap-sort!
2012/7/30, Eli Barzilay :
> A few minutes ago, Harry Spier wrote:
>> I would find a sort function for vectors very useful.
>
> Actually, the `sort' code uses a vector to do its work, which is
> initialized from the input list. But it doesn't help much to m
A few minutes ago, Harry Spier wrote:
> I would find a sort function for vectors very useful.
Actually, the `sort' code uses a vector to do its work, which is
initialized from the input list. But it doesn't help much to make it
deal with vectors too, since the vector that is used for the sorting
I would find a sort function for vectors very useful.
Thanks,
Harry Spier
_
Racket Developers list:
http://lists.racket-lang.org/dev
5 matches
Mail list logo
