Computer Science · Sorting Algorithms
Quick sort's average-case time complexity is O(n log n), but its worst-case occurs when:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The divide and conquer strategy fails
- 2The array is completely randomized
- 3The array is already sorted and the pivot is the first or last element✓
- 4The pivot is always the median
Correct answer
The array is already sorted and the pivot is the first or last element
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
Start Free Mock Test →Preparing for Computer Science?
Practice full-length 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