Big Θ
When an algorithm has a complexity with lower bound = upper bound, say that an algorithm has a complexity O (n log n) and Ω . (n log n), it’s actually has the complexity Θ (n log n), which means the running time of that algorithm always falls in n log n in the best – case and worst – case.
