We now consider several algorithmic problems of a purely combinatorial nature. These include sorting and permutation generations, both of which were among the first non-numerical problems arising on electronic computers. Sorting can be viewed as identifying or imposing a total order on the keys, while searching and selection involve identifying specific keys based on their position in this total order.
KeywordsCombinatorial Problem Binary Search Lexicographic Order Conjunctive Normal Form Degree Sequence
Unable to display preview. Download preview PDF.
- [Knu05a]D. Knuth. The Art of Computer Programming, Volume 4 Fascicle 2: Generating All Tuples and Permutations. Addison Wesley, 2005.Google Scholar
- [Knu05b]D. Knuth. The Art of Computer Programming, Volume 4 Fascicle 3: Generating All Combinations and Partitions. Addison Wesley, 2005.Google Scholar
- [Knu06]D. Knuth. The Art of Computer Programming, Volume 4 Fascicle 4: Generating All Trees; History of Combinationatorial Generation. Addison Wesley, 2006.Google Scholar
- [KS99]D. Kreher and D. Stinson. Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press, 1999.Google Scholar
- [Rus03]F. Ruskey. Combinatorial Generation. Manuscript in preparation. Draft available at http://www.1stworks.com/ref/RuskeyCombGen.pdf, 2003.