<Dd> sin ⁡ x + 1 = Ω (1) (x → ∞), (\ displaystyle \ sin x + 1 = \ Omega (1) \ (x \ rightarrow \ infty),) </Dd> <P> and more precisely </P> <Dl> <Dd> sin ⁡ x + 1 = Ω + (1) (x → ∞); (\ displaystyle \ sin x + 1 = \ Omega _ (+) (1) \ (x \ rightarrow \ infty);) </Dd> </Dl> <Dd> sin ⁡ x + 1 = Ω + (1) (x → ∞); (\ displaystyle \ sin x + 1 = \ Omega _ (+) (1) \ (x \ rightarrow \ infty);) </Dd>

Why the big-o notation is a very useful way of analyzing algorithm complexity