What will be the worst case time complexity of the following code? – McqOptions

MCQOPTIONS

1.	What will be the worst case time complexity of the following code?
A.	O(n1/2)
B.	O(n)
C.	O(n3/2)
D.	O(n2)View Answer
Answer» E.

Discussion

No Comment Found

Related MCQs

What is the minimum possible time complexity to find the number of steps to reach the end of an array?
: It is not possible to reach the end of an array if starting element of the array is 0.
What will be the worst case time complexity of the following code?
In how many different ways we can reach the end of the array arr[]={1,3,5,8,9}?
It is not possible to find the minimum number of steps to reach the end of an array in linear time.
What will be the minimum number of jumps required to reach the end of the array arr[] = {1,2,0,0,3,6,8,5}?
What will be the minimum number of jumps required to reach the end of the array arr[] ={0,1,3,6,3,6,8,5}?
What will be the minimum number of jumps required to reach the end of the array arr[] = {1,3,6,3,6,8,5}?