Algorithms | Analysis of Algorithms | Question 4

Last Updated :
Discuss
Comments

O( n2 ) is the worst case time complexity, so among the given options it can represent :-

O( n )

O( 1 )

O ( nlogn )

All of the above

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy