search
Log In
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Sep 2019
  1. Satbir

    567 Points

  2. Bikram

    566 Points

  3. GAITONDE

    348 Points

  4. Vimal Patel

    87 Points

  5. Shaik Masthan

    38 Points

  6. BLACK_CLOUD

    14 Points

  7. sekhar_1621

    13 Points

  8. OgbeborBeatrice

    13 Points

  9. RAMYA.F

    9 Points

  10. vkw1111

    9 Points

0 votes
4 views
Consider th following cases for quick sort to sort an array of n element $a[0...n-1]$

i) Choosing the pivot element randomly from the given array

ii) choosing median element as pivot.

Iii) Choosing middle element as pivot

For which of the above cases quick sort always gives $O(nlogn)$ time complexity?
in Algorithms 144 points 4 views

Please log in or register to answer this question.

...