How deeply does Statistics Slam Dunk cover permutation?

Defines ordering and replacement, distinguishes formulas conceptually, and computes or prints arrangements without developing formal derivations.

Permutation

As explained in Statistics Slam Dunk

A permutation without replacement is an ordered arrangement in which a selected element cannot be selected again.

A permutation is an ordered arrangement: changing the positions changes the result. A permutation without replacement does not allow a selected element to appear again, while one with replacement does. section 9.4

Use these questions to identify the arrangement type:

Does order matter? A final standings order is a permutation; a starting lineup is a combination because announcement order does not change the lineup. section 9.4
Can an element recur? An NBA lottery is a permutation without replacement because a team cannot be selected twice. section 9.4
Can an element recur? Home and away teams’ prior days off form permutations with replacement because both teams may have the same number of days off. section 9.4

Counting prior-days-off arrangements

With five possible values and two ordered positions, the count is 5^2 = 25. The resulting pairs include (0,0), (0,1), (1,0), and (4,4), showing both that order matters and that values can repeat.

How Statistics Slam Dunk covers it

liveBook manning.com

Read Statistics Slam Dunk on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Statistics Every Programmer NeedsA permutation without replacement is an ordered arrangement in which each item may be selected at most once.
liveBook manning.com

Optimization Algorithms: AI techniques for design, planning, and control problemsA permutation is an ordered arrangement of elements in which each element appears exactly once.
liveBook manning.com

Fabulous Adventures in Data Structures and AlgorithmsA permutation is an ordering of all elements of a sequence or set.
liveBook manning.com

Classic Computer Science Problems in Swift: Essential techniques for practicing programmersA permutation is an ordering of the elements of a collection in which each element appears exactly once.
liveBook manning.com

Advanced Algorithms and Data StructuresA permutation is an arrangement of the elements of a sequence in which each element occurs exactly once.
liveBook manning.com

Real-World CryptographyA permutation is a reversible one-to-one mapping of a set of elements onto itself.
liveBook manning.com

Quantum Programming in DepthA permutation is an arrangement containing each member of a finite set exactly once.
liveBook manning.com

Get Programming: Learn to code with PythonA permutation is an arrangement of selected items in which order distinguishes the arrangement.

Compare how 9 books explain permutation →

Related concepts

combinationcontrasts with · A combination is a selection of elements in which the order of selection does not matter.
permutation with replacementincludes · A permutation with replacement is an ordered selection in which each item remains available for subsequent selection.
shuffleproduced by · Shuffling is the random rearrangement of elements in a collection, sequence, or dataset.
sequenceuses · A sequence is an ordered collection of elements whose positions determine their order of traversal or processing.
search spacepart of · A search space is the set of possible states, choices, configurations, or candidate solutions that may be considered when exploring or solving a problem.
keccak-fincludes · keccak-f is the fixed-size permutation used as the internal transformation in SHA-3.

This explainer was generated by Manning's knowledge graph from the text of Statistics Slam Dunk. The section links point to the parts of the book it draws on.