Programming MCQ Feed 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 Programming MCQ Feed question from Programming. After checking the answer, return to the topic list to practice more or run a timed set.

← More Programming MCQ Feed MCQs All Programming topics Mock test hub

WhatsApp+91 99922 70404Programming MCQ Feed MCQ: Which of the following sorting algorithms does NOT have a worst-case running time of O(n2)? | Extra Education