Data Structures :: Basic Concepts - Discussion
Home > Data Structures > Basic Concepts > MCQs Questions Discussion
8 / 18
Choose the correct option.
Time complexities of three algorithms are given. Which should execute the slowest for large values of N?
AO(N^1/2)
BO(N)
CO(log n)
DNone of these
Answer: Option (Login/Signup)
Show Explanation