What is the worst case time complexity of quicksort? Is it N^2 or it is NlogN?
What would be an algorithm for quicksort considering the median as Pivot and what will be its complexity in the worst, average and best case?