Which of the following sorting algorithm has best case time complexity of O(n2)?

Explore topic-wise MCQs in Recursive Selection Sort Multiple Choice.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Recursive Selection Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.

1.	Which of the following sorting algorithm has best case time complexity of O(n2)?
A.	bubble sort
B.	selection sort
C.	insertion sort
D.	stupid sort
Answer» C. insertion sort

Discussion