Program for Quick Sort in C++

Here you will get program for quick sort in C++.

Quick Sort is one of the most efficient sorting algorithm whose best, worst and average case time complexities are O (n log n), O (n2) and O (n log n) respectively.

 How it works?

1. We first pick a pivot element. There are various ways to pick a pivot element.

  • Pick first element
  • Pick last element
  • Pick a random element
  • Pick median element

So we can use anyone of above methods to pick the pivot element. In the program given below I have picked first element as pivot.

2. Now all the elements smaller than pivot are placed at its left while elements bigger are placed at right.

3. Repeat the above two steps recursively for both half.

Below is the program to implement this algorithm in C++.

Program for Quick Sort in C++

 

Output

How many elements?6

Enter array elements:9 15 6 7 10 12

Array after sorting:6 7 9 10 12 15


Category: DSA

6 thoughts on “Program for Quick Sort in C++

  1. simplicity

    interesting code but is not actually giving what was expected after sorting.please will be happy if it can be enhanced more…..thanks

    Reply
  2. Tom

    in partition function
    u have initialized i = l and j = u+1
    instead, it should be i= l+1 and j=u

    Reply
  3. shivansh shukla

    I am getting an error near the line int 1,int u and it telling that expected ‘,’ , ‘… ‘ declaration missing.could you help me out.

    Reply
  4. Teja

    Nice its working. Please can you mention what does variables j,v,u stand for?

    Reply
  5. Siddharth

    please make your code a little more elaborate, won’t do any good if you don’t use good programming practices if people can’t understand your code

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.