2
$\begingroup$

Let's say we have two "Big-Oh" sets called $\text{Constant}$ and $\text{Logarithmic}$, such that one has $O(1)$, and the other has $O\big(\log(n)\big)$, respectively, how would I show that $\text{Constant} \subseteq \text{Logarithmic}$?

2 Answers 2

4

Higher order set contains lower order set. In your case $\lim \limits_{n\rightarrow \infty}\frac{\log n}{1}=\infty.$

2

Hint:

Logarithms are increasing and unbounded. But a constant is bounded.