home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.edu
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!sdd.hp.com!think.com!linus!linus.mitre.org!crawford
- From: crawford@church.mitre.org (Randy Crawford)
- Subject: Re: The definition of algorithm (was: Programmers)
- Message-ID: <1992Sep15.194008.27407@linus.mitre.org>
- Sender: crawford@church (Randy Crawford)
- Nntp-Posting-Host: church.mitre.org
- Organization: The MITRE Corporation, McLean, VA
- 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> <1992Sep15.170353.8665@newshost.lanl.gov>
- Date: Tue, 15 Sep 1992 19:40:08 GMT
- Lines: 26
-
- In article <1992Sep15.170353.8665@newshost.lanl.gov>, jlg@cochiti.lanl.gov (Jim Giles) writes:
- > In article <1992Sep12.043133.6177@linus.mitre.org>, crawford@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.
-
- I'm not so sure of the difference. All descriptions of Quicksort use
- a natural language (English), a PDL, or an implementation language.
- Any of these may incorrectly specify how to do a Quicksort, but none
- is more essentially `Quicksort' than any other.
-
- The abstract procedural/mathematical idea `Quicksort' is based as much
- in _some_ language as qsort is. qsort is simply a specific description
- of a Quicksort (in C ?).
- --
-
- | Randy Crawford crawford@mitre.org The MITRE Corporation
- | 7525 Colshire Dr., MS Z421
- | N=1 -> P=NP 703 883-7940 McLean, VA 22102
-