1.

Randomized quick sort is an in place sort.(a) true(b) falseI have been asked this question during an interview.My question is taken from Sorting in division Sorting of Data Structures & Algorithms II

Answer»

The correct choice is (a) true

Explanation: In-place algorithms REQUIRES CONSTANT or very less auxiliary space. Quick sort qualifies as an in place sorting algorithm as it has a very low auxiliary space requirement of O(LOG N).



Discussion

No Comment Found

Related InterviewSolutions