In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexity of quick sort.
@Verma Ashish
yeah, it seems to $O(n^3)$ but I didn't solve it.
@ajaysoni1924
please post the given solution.
64.3k questions
77.9k answers
244k comments
80.0k users