WorldQuant interview question

What is the complexity of the Quick Sort algorithm?

Interview Answers

Anonymous

Dec 5, 2018

O(nlogn)

Anonymous

Nov 14, 2019

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