What is the Time complexity of this Program?

I think it should be O(n*logn), but it seems it’s more then that…

//bo is a string consisting of '0's and '1's
for(int i=0;i<n;i++){
    int from=i,to=i;

worst time complexity is (n^2 * log(n)) when string is 000000000.

1 Like

Yes, that feels right. I was confused because I used this “here” on codeforces where n is 2e5 and somehow It got accepted. Why?

Because of amortized case ; P

Can you explain ? …

Amortized case means not all the test cases are big enough, some test cases are small and some are meet the constraints,
So if we calculate the overall computations of your code will be less than the worst case …

Because not every case is the case ; P

1 Like

So basically Test cases are weak ?

How will I know if my method will give AC in these kind of problems…

Yeah you can say that test cases are weak ; P