liveBook · Manning

Permutation

As explained in Timeless Algorithms, The Foundational Ideas

A permutation is an arrangement of objects or outcomes in which order matters.

A permutation treats order as part of the outcome. In repeated trials, heads, heads, tails, heads, tails is one specific arrangement; asking only for three heads and two tails groups many arrangements together as a combination. section 2.3.5

P(H, H, T, H, T)=0.5 × 0.5 × 0.5 × 0.5 × 0.5=(0.5)5=0.03125

The multiplication rule gives the probability of this particular ordered sequence; other sequences can have the same outcome totals. section 2.3.5

Counting problems may deliberately ignore order: a coin-change recurrence counts each valid combination once, rather than treating different orderings of the same coins as separate solutions. section 6.3.2

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Explains ordered trial sequences and contrasts them with combinations, but does not develop a general permutation-counting formula.
Examples
Uses a heads-and-tails sequence and coin denominations to distinguish ordered outcomes from combinations counted once.
What you can do after
Understand how order changes the event being counted and why a recurrence may count reorderings only once.
How it connects
Connects permutations with combinations and the multiplication rule, and with coin-change counting that excludes duplicate orderings.

Also explained in

Compare how 10 books explain permutation →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.