Description:
Ordering of operators is purely combinatorial task involving a number of commutators shuffling components of operator expression to desired form. Here we show how it can be illustrated by simple urn models in which normal ordering procedure is equivalent to enumeration of urn histories.