What is worst case complexity of quick sort?

Selection sort has no end conditions built in, so it will always compare every element with every other element.

This gives it a best-, worst-, and average-case complexity of O(n2).