Path: utzoo!attcan!uunet!husc6!think!ames!pasteur!ucbvax!UICVM!U23405
From: U23405@UICVM (Michael J. Steiner)
Newsgroups: comp.lang.c
Subject: Sorting algorithms...
Message-ID: <8808171405.AA05232@ucbvax.Berkeley.EDU>
Date: 16 Aug 88 00:33:13 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The Internet
Lines: 17

I have heard of many types of sorting alorithms (such as insertion,
merge, selection, shell, and quick) (I'm not even mentioning bubble sort
:-).

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
in statistics about these sorting alorithms, such as which sort is
efficient for which kind of data, etc.)

I would appreciate it if you could send the algorithms coded in C (if you
decide to send the actual algorithms instead of a pointer :-) to them).

Also, does anyone have any informaion about mergesort?

                                                 Michael Steiner
                                                 Email: U23405@UICVM