- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
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 AnswersTags:
Share your thoughts in the comments
GeeksforGeeks