cvs.gedasymbols.org/archives/browse.cgi | search |
From: | spamlessdunkelzan AT geocities DOT com (Paul Szuch) |
Newsgroups: | comp.os.msdos.djgpp |
Subject: | Re: Sorting Algorythums |
Date: | Tue, 24 Feb 1998 19:11:33 GMT |
Organization: | The University of Calgary |
Lines: | 13 |
Message-ID: | <6cv625$7o6@ds2.acs.ucalgary.ca> |
References: | <34F113BA DOT 203AD4E9 AT earthlink DOT net> |
NNTP-Posting-Host: | pszuch AT ts5-port-12 DOT acs DOT ucalgary DOT ca |
To: | djgpp AT delorie DOT com |
DJ-Gateway: | from newsgroup comp.os.msdos.djgpp |
Don't forget Radix or Bucket sorts both are the fastest I know of at O(N) but have some special requirements. Radix will only compare integers and bucket requires temporary storage. On Sun, 22 Feb 1998 22:14:18 -0800, "STEVEN S. FALLS" <broadview AT earthlink DOT net> wrote: > What is the best sorting algorythm and what is it. I mean, how would >one program the algrothym? > Thanks, > -Ardy >
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |