Concept drill

quick-sort

GATE CSE & IT · Sorting · 2009-2009

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

2009 PYQ

In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case time complexity of the quick sort?

mediumanswer key