O( n2 ) is the worst case time complexity, so among the given options it can represent :-
(A)
O( n )
(B)
O( 1 )
(C)
O ( nlogn )
(D)
All of the above
Answer: (D)
Explanation:
O( n2 ) is the worst case time complexity, so, if the time complexity is O( n2 ), they all can be represented by it.
Quiz of this Question
Please comment below if you find anything wrong in the above post