Combinatorial AlgorithmsHerbert S. Wilf
Combinatorial Algorithms
by Herbert S. Wilf · first published 1989
2mentions
1recommended by
2HN commenters
2020–2023first – last mentioned
50% recommend50% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…ranking and unranking. Sedgewick 77 [1] calls it the Fischer-Krause algorithm. The traditional (and still readable) reference for generating combinatorial objects such as permutations is Nijenhuis & Wilf's Combinatorial Algorithms. The author of the article ubiquitously misspells "lexicographic" as "lexographic." That might make it harder to Google the term. [1] https://www.princeton.edu/~rblee/ELE572Papers/p137-sedgewick...
on “Permutation Iteration and Random Access” ↗Of course this is a n^2 sort. Combinatorial Algorithms by Nijenhuis and Wilf, 1975, has a 23 lines Fortran implementation of Heapsort, a n log n sort. It is available on the web and easily found, so I am going to list it here. I am not going to attempt to…
on “The tiniest C sort function? (2008)” ↗