Re: Sorting Algoithms History

From: Mark Haase (mehaase_at_earthlink.net)
Date: 12/13/04 

Date: Mon, 13 Dec 2004 13:12:05 -0500

In article <cpfuu3$7bd$1@news.netins.net>,
 "Russell" <russ@webrussNOSPAM.com> wrote:

> Can anyone point me in the right direction (webpages) that will show me the
> originating authors/programmers of algorithms and maybe some history of
> their respective development like the "insertion, selection bubble, merge,
> quick, heap......etc"
>
> thanks

http://www.google.com/search?q=history+of+sorting+algorithms&ie=UTF-8&oe=
UTF-8 

-- 
|\/|  /|  |2  |<
mehaase(at)sas(dot)upenn(dot)edu

Relevant Pages

  • Re: Alghorithm: Complessity and Correcting.
    ... > algorithms of arrangement (Selection Sort, Insertion Sort, ...
    (comp.theory)
  • Re: Q: How to determine the input to ciphers
    ... Since you mention history, let's consider an analogy ... 'variability' that plays ... 'variability' could render the formal study simpler ... algorithms could have a chance of succeed. ...
    (sci.crypt)
  • Alghorithm: Complessity and Correcting.
    ... correctness of the algorithms: ... arrangement (Selection Sort, Insertion Sort, Merge Sort) Vector Heap ... sequential Search of an element in an array, binary Trees (Bin Search, ...
    (comp.theory)
  • Re: Database/Table Design Question - Object/Event Model
    ... Log - an ordered record of what happened when ... History - a record of the state of your data at a given point in time. ... Folder table. ... is that even though you're tracking insertion and deletion - for ...
    (comp.databases.ms-sqlserver)
  • Re: My other research, beyond surrogate factoring
    ... > in the history of the page. ... I presume it's this function p that you're claiming. ... unless you've got good reasons to. ... TAOCP gives one way of setting out algorithms (a bit old-fashioned, ...
    (sci.crypt)