Question

Which of the sorting algorithm has best performance in terms of storage and time complexity?

Answer 1

Quicksort algorithm has ‘best performance’ in terms of ‘storage and time complexity’.

Explanation:

• Quicksort algorithm is considered to be the best performance algorithm with respect to time based complexity and storage.  

• The time complexity of Quicksort can be defined as O(n log n) in the best case, O(n log n) in the ordinary case, and O(n^2) in the worst case.

• Quicksort has the ‘best performance’ in the ‘average case’ for most inputs, it is considered the ‘fastest sorting algorithm’ based on its storage capacity.