[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

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

Asked In ::

Post Your Answer Here:     

Reply    
Rate This: +0 -0
    Report


Report Error

Please Login First Click Here