Sorting and Listing: Combinatorics for Computer Science

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.