Re: Separating algorithms from implementations (long)

Dara Gallagher <dara_gallagher@my-deja.com>
13 Sep 2000 20:19:41 -0400

          From comp.compilers
Related articles
[2 earlier articles]
Re: Separating algorithms from implementations (long) mal@bewoner.dma.be (Lieven Marchand) (2000-09-07)
Re: Separating algorithms from implementations (long) noelw@dai.ed.ac.uk (Noel Welsh) (2000-09-08)
Re: Separating algorithms from implementations (long) joachim_d@gmx.de (Joachim Durchholz) (2000-09-08)
Re: Separating algorithms from implementations (long) toon@moene.indiv.nluug.nl (Toon Moene) (2000-09-08)
Re: Separating algorithms from implementations (long) dara_gallagher@my-deja.com (Dara Gallagher) (2000-09-09)
Re: Separating algorithms from implementations (long) jthorn@galileo.thp.univie.ac.at (2000-09-09)
Re: Separating algorithms from implementations (long) dara_gallagher@my-deja.com (Dara Gallagher) (2000-09-13)
Re: Separating algorithms from implementations (long) fjh@cs.mu.OZ.AU (2000-09-13)
Re: Separating algorithms from implementations (long) nr@labrador.eecs.harvard.edu (2000-09-23)
| List of all articles for this month |
From: Dara Gallagher <dara_gallagher@my-deja.com>
Newsgroups: comp.graphics.algorithms,comp.compilers,comp.dsp
Date: 13 Sep 2000 20:19:41 -0400
Organization: Deja.com - Before you buy.
References: 00-08-124 00-09-072
Keywords: ML, comment

whoops,
  As Lieven Marchand points out, the given quicksort was
missing the recursive calls; it should have been


qsort [] = []
qsort (p:x) = qsort [ e | e <- x, e <= p ] ++ [ p ] ++ qsort [ e | e <-
x, e > p ]


Cheers,
Dara.
[I thought it looked kind of short. -John]

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.