Having seen asymptotic notation informally, let’s get more formal. The notations we use to describe the asymptotic running time of an algorithm are deûned in terms of functions whose domains are typically the set N of natural numbers or the set R of real numbers. Such notations are convenient for describing a running- time function T .n/. This section defines the basic asymptotic notations and also introduces some common “proper” notational abuses.