jishan
what is the complexity of quick short???????



This Question is Closed

hartnn
Best Response
You've already chosen the best response.
0
O(log n)
and is quickest

hartnn
Best Response
You've already chosen the best response.
0
this is not a math question, ask in comp science group

jishan
Best Response
You've already chosen the best response.
0
yes bro

jishan
Best Response
You've already chosen the best response.
0
all case of complexity ans to me bro

hartnn
Best Response
You've already chosen the best response.
0
all case = log n
i think