What is the auxiliary space requirement of permutation sort?
(a) O(n)
(b) O(1)
(c) O(log n)
(d) O(n log n)
The question was asked in a job interview.
I would like to ask this question from Sorting topic in chapter Sorting of Data Structures & Algorithms II