Combinatorial algorithms for computers and calculators / / Albert Nijenhuis and Herbert S. Wilf.
Combinatorial Algorithms
Gespeichert in:
E-Book
| Person(en) | , |
|---|---|
| Ausgabe | 2nd ed. |
| Ort, Verlag, Jahr |
New York ; London, England
: Academic Press
, 1978
|
| Umfang | 1 online resource (320 p.) |
| ISBN | 1-4832-7345-8 |
| Sprache | Englisch |
| Zusatzinfo | Description based upon print version of record. |
| Zusatzinfo | Front Cover; Combinatorial Algorithms: For Computers and Calculators; Copyright Page; Dedication; Table of Contents; Preface to Second Edition; Preface to First Edition; Introduction; Aims; Highlights; Categories of Usage (Part I); Structure of the Chapters; The Specifications List; Structure of the ""Next"" Programs; Structure of the ""Random"" Programs; Arrays and Specifications; PART I: COMBINATORIAL FAMILIES; Chapter 1. Next Subset of an n-Set (NEXSUB/LEXSUB); (A) The Direct Approach; (B) The Gray Code; Algorithm NEXSUB; (C) Lexicographic Sequencing; Algorithm LEXSUB Subroutine Specifications (NEXSUB)Subroutine Specifications (LEXSUB); Sample Output (NEXSUB); Sample Output (LEXSUB); Chapter 2. Random Subset of an n-Set (RANSUB); Algorithm RANSUB; Subroutine Specifications; Sample Output; Chapter 3. Next k-Subset of an n-Set (NEXKSB/NXKSRD); Algorithm NEXKSB (Lexicographic); Flow Chart NXKSRD; Subroutine Specifications (NEXKSB); Subroutine Specifications (NXKSRD); Sample Output (NEXKSB); Sample Output (NXKSRD); Chapter 4. Random k-Subset of ann-Set (RANKSB); Algorithm RANKSB; Algorithm RKS2; Subroutine Specifications; Sample Intermediate Result Sample OutputChapter 5. Next Composition of n into k Parts (NEXCOM); Algorithm NEXCOM; Subroutine Specifications; Sample Output; Chapter 6. Random Composition of n into k Parts (RANCOM); Algorithm RANCOM; Subroutine Specifications; Chapter 7. Next Permutation of n Letters (NEXPER); Algorithm NEXPER; Subroutine Specifications; Sample Output; Chapter 8. Random Permutation of n Letters (RANPER); Algorithm RANPER; Subroutine Specifications; Sample Output; Chapter 9. Next Partition of Integer n (NEXPAR); Algorithm NEXPAR; Subroutine Specifications; Sample Output Chapter 10. Random Partition of an Integer n (RANPAR)Algorithm RANPAR; Subroutine Specifications; Sample Output; Postscript: Deus ex Machina; Algorithm NEXT PLANE PARTITION; Chapter 11. Next Partition of an n-Set (NEXEQU); Algorithm NEXEQU; Subroutine Specifications; Sample Output; Chapter 12. Random Partition of an n-Set (RANEQU); Algorithm RANEQU; Flow Chart RANEQU; Subroutine Specifications; Sample Output; Chapter 13. Sequencing, Ranking, and Selection Algorithms in General Combinatorial Families (SELECT); (A) Introduction; (B) General Setting; Algorithm NEXT; (C) Examples (D) The Formal AlgorithmsAlgorithm SELECT; Subroutine Specifications; (E) Decoding; Sample Output; Chapter 14. Young Tableaux (NEXYTB/RANYTB); (A) Introduction; (B) Lexicographic Sequencing; Algorithm NEXYTB; (C) Random Selection; Algorithm RANYTB; Subroutine Specifications (NEXYTB); Subroutine Specifications (RANYTB); Sample Output; PART II: COMBINATORIAL STRUCTURES; Chapter 15. Sorting (HPSORT/EXHEAP); Algorithm(l, n); Algorithm TOHEAP; Algorithm SORTHEAP; Subroutine Specifications (HPSORT); Subroutine Specifications (EXHEAP); Sample Output Chapter 16. The Cycle Structure of a Permutation (CYCLES) |
| Zusatzinfo | English |
| Serie/Reihe | Computer science and applied mathematics. |
| Online-Zugang | Elsevier SD eBook - Mathematics (Legacy 1) [EBCML1] |
Bei Problemen beim Zugriff auf diese Online-Quelle beachten Sie unsere Hinweise zum Zugriff auf lizenzierte Angebote von außerhalb des Campus.