Asymptotic notations basically describe how an algorithm’s running time grows with input size.

O (Big O) - Upper bound - for the worst case.

Example: Bubble Sort → O(n²).

Ω (Big Omega) - Lower bound - for the best case.

Example: Bubble Sort → Ω(n).

Θ (Big Theta) - Tight bound - when both upper and lower are same.

Example: Merge Sort → Θ(n log n).