another approach arr=[6,5,11,9,10,10] sum=0 a=min(arr) b=a count=0 while(b): count+=1 b=b>>1 sum+=count-1+len(arr)+(a-(1

@hermesmercuriustrismegistu4841

4 жыл бұрын

Ankit Sharma clever solution!

Waw what a clever solution!

what is the time complexity of this algorithm ?

Its just not about just reciting the solutio and say , u have to explain Srsly he is just saying out whats written there

What is the time complexity for this solution?

When you guys explain a problem, can you please focus more on the logical part and how to approach a problem rather than just explaining the code.

its not the way man to teach DSA like this...U just take the code from gfg and just u are saying on that particular line. how to approach ,why we are approching u should teach us na

the guys who explain these questions totally dont explain nicely