[EMAIL PROTECTED] wrote:
>
> Thanks DSC. Great site.
> To the first person who replied, sorry the message was deleted and i
> lost your name. No, this was not a class assignment - not that anything
> was wrong if it were so! We were and are still are students, always
> learning. I simply asked
On Sun, May 05, 2002 at 08:57:51PM +0200, DSC Siltec wrote:
> If I think about it, this definitely isn't the quicksort. However, it
> may be that it is mathematically equivalent to the heapsort. In fact,
> it may be an easy implementation of the heap sort.
>
> Anyhow, when I was looking back
If I think about it, this definitely isn't the quicksort. However, it
may be that it is mathematically equivalent to the heapsort. In fact,
it may be an easy implementation of the heap sort.
Anyhow, when I was looking back at the data, the same Nlog2N factor came
out, and www.nr.com at least
Tinus Kotze wrote:
>
> On Sun 05 May 02 16:03, DSC Siltec wrote:
> > Deosaran Bisnath wrote:
> > > I am new to linux g++ & am not sure how to do this. Your help is
> > > most welcome
> > >
> > > there are about 50 data points like this, x and y
> > >
> > > x y
> > > 2.4 1
> >
On Sun 05 May 02 16:03, DSC Siltec wrote:
> Deosaran Bisnath wrote:
> > I am new to linux g++ & am not sure how to do this. Your help is
> > most welcome
> >
> > there are about 50 data points like this, x and y
> >
> > x y
> > 2.4 1
> > 67.21 2
> > 1.9 3
> > 21
Deosaran Bisnath wrote:
>
> I am new to linux g++ & am not sure how to do this. Your help is most
> welcome
>
> there are about 50 data points like this, x and y
>
> x y
> 2.4 1
> 67.21 2
> 1.9 3
> 211.45 4
>
> I want to sort x in ascending or descendin
6 matches
Mail list logo
