campus placement AMCAT Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
In sorted array of size n, time required to verify if there exists 2 numbers a and b such that
a + b = S in worst case?
Where S is a constant1
0(logn)
2
O(n)
3
\(0\left( {\sqrt n } \right)\)
4
0(n2)