1

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

Correct Answer: selection sort

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Design and Analysis of Algorithms MCQ: Which of the following sorting algorithm has best case time complexity of O(n2)? | Extra Education