Product Description
by S. Gill Williamson (Author)
These units of study present the basics of sorting and listing from the point of view of combinatorial algorithms. We focus on mathematical concepts as well as on the vizualization of algorithms through the use of graphical and pictorial methods. Sorting and merging algorithms are discussed, including sorting networks. We study listing, ranking and unranking algorithms for the basic sets that serve as building blocks of combinatorics. This approach will give you the tools to invent your own algorithms for a wide range of problems.
Author Biography
Education: BS in Mathematics from Caltech (1960); MS in Statistics from Stanford University (1962); PhD in Mathematics from the University of California, Santa Barbara (1965). Professional: Professor of Mathematics at the University of California, San Diego (UCSD) from 1965 to 1991, Professor of Computer Science and Engineering at UCSD from 1991 to 2004 (Department Chair, 1991 to 1996); currently Professor Emeritus Computer Science and Engineering, UCSD. Website: http: //cseweb.ucsd.edu/ gill/
