Path: utzoo!attcan!uunet!lll-winken!lll-tis!ames!ucsd!ucsdhub!sdsu!roetzhei
From: roetzhei@sdsu.UUCP (William Roetzheim)
Newsgroups: comp.lang.c
Subject: Re: Sorting algorithms...
Message-ID: <3119@sdsu.UUCP>
Date: 18 Aug 88 21:18:18 GMT
References: <8808171405.AA05232@ucbvax.Berkeley.EDU>
Reply-To: roetzhei@sdsu.UCSD.EDU (William Roetzheim)
Organization: San Diego State University, Math/Sciences Dept.
Lines: 12

In article <8808171405.AA05232@ucbvax.Berkeley.EDU> U23405@UICVM (Michael J. Steiner) writes:
>I already have the algorithms for insertion sort and selecton sort. Could
>anyone send me the algorthms, explanations of them, where to find the
>algorithms, or where to find explanations of them? (I am also interested

  Sedgwick's (sp?) "Algorithms" has a good treatment of many sort algorithms,
including merge sort.  The algorithms are in Pacal and include good advice
about when they are appropriate.  The book "Numerical Recipies" also has
many good sort algorithms.  My version gives examples in fortran (which is
a pain to convert to C because of different indexing of arrays), but there
is now a version out with examples in C (I have it on order).

WHR