How to its complexity is the 0(n)

#1

its should be 0(n^2), worst case

#2

@iamkdblue Please mention the problem whose complexity you are asking.

#3

problem name is Biased Standings

#4

@iamkdblue In this problem we were following the approach of Counting sort. You must know that Best, average and worst case time complexity of count sort is: O(n+k) where k is the size of count array. So this will take linear time.

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.