A stem-and-leaf diagram sorts a list of numbers while keeping every value.
Each number is split into a stem (the leading digit or digits) and a
leaf (the last digit). For example
Take the data
| Stem | Leaf |
|---|---|
| 1 | 2 5 |
| 2 | 1 3 3 |
| 3 | 4 8 |
Every diagram must include a key so the reader knows the place value of the digits:
Key:
Reading along the rows recovers the sorted data exactly: