What is the time complexity of the following recursive implementation – McqOptions

MCQOPTIONS

1.	What is the time complexity of the following recursive implementation used to find the largest and the smallest element in an array?
A.	O(1)
B.	O(n)
C.	O(n2)
D.	O(n3)View Answer
Answer» C. O(n2)

Discussion

No Comment Found

Related MCQs

The 3 sigma limits on x bar control charts imply that the type I error probability is __________
Never attempt to interpret the x chart when the R chart indicates the out of control condition.
Stratification of points on a control chart indicates __________ of natural variability of the process.
Stratification is defined as ________
Shift in process level can be seen on the control charts when __________
Which of these is a cause of trend patterns on a control chart?
Which chart should be interpreted first when both, x chart, and R chart are indicating a non-random behavior?
The control limits obtained by specifying the type I error level for the test, are called ________
When using standard values of process mean and standard deviation, the equation of UCL for a x chart is given as, UCL = μ+AσWhat is the value of A here?
Unlike x chart, which measures between-sample variability only, an R chart is used to monitor ____