home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.edu
- Path: sparky!uunet!europa.asd.contel.com!darwin.sura.net!zaphod.mps.ohio-state.edu!caen!hellgate.utah.edu!lanl!cochiti.lanl.gov!jlg
- From: jlg@cochiti.lanl.gov (Jim Giles)
- Subject: The definition of algorithm (was: Programmers)
- Message-ID: <1992Sep15.170353.8665@newshost.lanl.gov>
- Sender: news@newshost.lanl.gov
- Organization: Los Alamos National Laboratory
- References: <1992Sep10.142205.16217@merlin.dev.cdx.mot.com> <BuDHvA.226@mentor.cc.purdue.edu> <PSU.92Sep11102557@ptero.cs.duke.edu> <1992Sep12.043133.6177@linus.mitre.org>
- Date: Tue, 15 Sep 1992 17:03:53 GMT
- Lines: 14
-
- In article <1992Sep12.043133.6177@linus.mitre.org>, crawford@church.mitre.org (Randy Crawford) writes:
- |> >[...]
- |> >- The libraries have a routine called qsort, [...]
- |>
- |> This is an algorithm, not math theory. [...]
-
- NO. Quicksort is an algorithm. The routine `qsort' is a program
- which *maybe* implements quicksort correctly. Since this is comp.edu,
- we should make an attempt - at least here - to recognize that an
- algorithm is an abstract mathematical concept and not any specific
- program.
-
- --
- J. Giles
-