Quick sort uses which of the following algorithm to implement sorting?
(a) backtracking
(b) greedy algorithm
(c) divide and conquer
(d) dynamic programming
I have been asked this question in homework.
The query is from Sorting topic in chapter Sorting of Data Structures & Algorithms II