https: en.wikipedia.org wiki... space complexity O (n log n) I read other materials to write O (root n), which I understand. Wiki divided by log (n) what s going on ...
what is the time complexity of the algorithm in the following code? it s best to explain the idea . i= s = 0; while (s<n) { iPP; s+=i; } ...
if you have a question, find the answer ...
encountered a multiple choice question and did not find a solution. Please take a look at it I think the second one is chosen, but the answer is wrong ...