For the extra space taken by an internal sorting algorithm, we h

For the extra space taken by an internal sorting algorithm, we have: heap sort < merge sort < quick sort.~@[](2)

答案：FALSE