Time complexities of three algorithms are given. Which should execute the slowest for large values of N?
A. O(N1/2)
B. O(N)
C. O(log N)
D. None of these
Answer:B
Time complexities of three algorithms are given. Which should execute the slowest for large values of N?
A. O(N1/2) B. O(N) C. O(log N) D. None of these