June 23, 2019
x1(n) + x2(n) is O(min(y1(n), y2(n)))
x1(n) + x2(n) is O(max(y1(n), y2(n)))
x1(n) + x2(n) is O(y1(n)*y2(n))
x1(n) + x2(n) is O(y1(n)-y2(n))
option : 2. visit following link
Please login to submit your explanation
You can check your performance of this question after Login/Signup
Amount of hard disk space required to store the program.
Amount of hard disk space required to compile the program.
Amount of memory required by the program to run.
Amount of memory required by the program to compile.
Currently there is no PrepInsta Explanation. Did you know?
You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.
None of these
O (log2 n)
O (n log2 n)
Vibhu cannot determine
Both codes have the same execution time, so deliver any.
Surbhi cannot determine
It is O(n)
It is O(n2)
It is Theta(n)
It is Theta(n2)
Please login to report
Login/Signup to comment