title: What is the worst case complexity for quick sort?
body: <p>Assuming that the first element is always chosen as the pivot element, can you please elaborate on where the worst case occurs and its time complexity also</p>