The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________
(a) n/2 : (n/2) – 1
(b) n/2 : n/3
(c) n/4 : 3n/2
(d) n/4 : 3n/4
I have been asked this question during an interview.
The question is from Quicksort in chapter Sorting of Data Structures & Algorithms II