big O

A notation used to describe the asymptotic behaviour of a particular function, usually the amount of time it takes for an algorithm to run

There is no sorting algorithm that is big O of n

tetrahedron

A regular polyhedron consisting of four triangular sides

The die that the DM was rolling was shaped like a tetrahedron

2👍 1👎