Computer Science · Sorting Algorithms
Which of the following sorting algorithms has a worst-case time complexity of O(n log n)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Selection sort
- 2Insertion sort
- 3Quicksort
- 4Heapsort✓
Correct answer
Heapsort
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Sorting Algorithms MCQs →Want more practice questions on Sorting Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Sorting Algorithms