Computer Science · Data Structures and Algorithms
The worst-case efficiency of the Quick Sort algorithm over an input array can be practically improved to an expected O(n log n) time by using which technique?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Non-recursive implementation
- 2Randomization (choosing a random pivot)✓
- 3Using a recursive method
- 4Pre-sorting the array
Correct answer
Randomization (choosing a random pivot)
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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms