WorldQuant interview question

What is the complexity of the Quick Sort algorithm?

Interview Answers

Anonymous

5 Dec 2018

O(nlogn)

Anonymous

14 Nov 2019

O(.) is for the upper bound, so it should be O(N^2).