title: complexity of quick sort algorithm
body: <p>The standard worst case complexity of quick sort is O(n^2). What is this worst case and how can I make modifications in such a case to come up with a better behaviour?
  This is just a theoretical question.</p>