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

by 2^63-1 November 29, 2021

tetrahedron

A regular polyhedron consisting of four triangular sides

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

by 2^63-1 May 31, 2015