C Programming MCQs MCQ: Which of the following sorting algorithms does NOT have a worst-case running time of O(n2)?

Which of the following sorting algorithms does NOT have a worst-case running time of O(n2)?

Correct Answer: Merge sort

Make the most of this question

This page focuses on one C Programming MCQs question from Programming. After checking the answer, return to the topic list to practice more or run a timed set.

← More C Programming MCQs MCQs All Programming topics Mock test hub

C Programming MCQs MCQ: Which of the following sorting algorithms does NOT have a worst-case running time of O(n2)? | Extra Education