393 views
0 votes
0 votes

Can anyone please explain

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
Nitesh_Yadav asked Apr 11, 2022
266 views
What is the time complexity of the below mentioned recursive function.int f(n){ if(n!=1){ return f(n/2)+f(n/2);}elsereturn 10;} O(n)O(n^2)O(log n)O(n logn)
0 votes
0 votes
1 answer
2
raja11sep asked Jan 15, 2022
835 views
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help
0 votes
0 votes
1 answer
3
2 votes
2 votes
2 answers
4
LRU asked Oct 15, 2021
625 views
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?