rjohnson@seas.gwu.edu (Ray Johnson) (06/28/90)
Hi, can anyone recomend a book or something that can tell me about different types of sorting algorithms. The ones I'm most interested in include the insert, bubble, selection, quick, heap and shell sorts of integers. I'm looking for information about who developed them, what there speed (order) is, a little history and theory about them and finially simple code for each sort. Thank you for any help or direction you can offer. -- Ray Johnson Internet: rjohnson@gwusun.gwu.edu Phone: (202)994-6853 The George Washington University -- Ray Johnson Internet: rjohnson@gwusun.gwu.edu Phone: (202)994-6853 The George Washington University
adam@media-lab.MEDIA.MIT.EDU (Adam Glass) (06/28/90)
In article <1989@sparko.gwu.edu> rjohnson@seas.gwu.edu (Ray Johnson) writes: > Hi, can anyone recomend a book or something that can tell me about > different types of sorting algorithms. Donald E. Knuth's "The Art of Computer Programming", published by Addison-Wesley, of Reading, MA is probably your best bet. You'll want Volume III: "Sorting and Searching." You can find this in just about any serious college library. Adam
vladimir@prosper (Vladimir G. Ivanovic) (06/28/90)
Everyone more or less agrees that Don Knuth's books are of extraordinary quality. It is also true that they are extraordinarily difficult to read. An easier, but nevertheless excellent choice is Robert Sedgewick's "Algorithms" which comes in two flavors, Pascal and C. Intermediate in reading difficulty between Sedgewick and Knuth is Thomas Standish's "Data Structure Techniques." It, like the other two texts, is of very high quality. It is my preference, but students dislike it - too mathematical. -- Vladimir -- Vladimir G. Ivanovic vladimir@sun.com M/S 12-33 or Sun Microsystems, Inc. vivanovic@sun.com