tightest upper bound can be determind for
a)worst case:eg quick sort O(n2)
b)avg case: eg.quick sort O(nlogn)
c)best case eg. quick sort O(nlogn)
In your case its for best case and depending upon condition its varies.
64.3k questions
77.9k answers
244k comments
80.0k users