C++ programs for sorting numbers in ascending order using Quick sort method

/* Write C++ programs for sorting a given list of elements in ascending order using Quick sort sorting methods */

#include<iostream.h>
#include<conio.h>
int a[10],l,u,i,j;
void quick(int *,int,int);
void main()
{
clrscr();
cout <<"enter 10 elements";
for(i=0;i<10;i++)
cin >> a[i];
l=0;
u=9;
quick(a,l,u);
cout <<"sorted elements";
for(i=0;i<10;i++)
cout << a[i] << " ";
getch();
}
 
void quick(int a[],int l,int u)
{
   int p,temp;
   if(l<u)
   {
   p=a[l];
   i=l;
   j=u;
    while(i<j)
   {
      while(a[i] <= p && i<j )
	 i++;
      while(a[j]>p && i<=j )
	   j--;
      if(i<=j)
      {
      temp=a[i];
      a[i]=a[j];
      a[j]=temp;}
  }
  temp=a[j];
  a[j]=a[l];
  a[l]=temp;
  cout <<"\n";
  for(i=0;i<10;i++)
  cout <<a[i]<<" ";
  quick(a,l,j-1);
  quick(a,j+1,u); 
 }
}

OUTPUT

enter 10 elements5 2 3 16 25 1 20 7 8 61 14

1 2 3 5 25 16 20 7 8 61
1 2 3 5 25 16 20 7 8 61
1 2 3 5 25 16 20 7 8 61
1 2 3 5 25 16 20 7 8 61
1 2 3 5 25 16 20 7 8 61
1 2 3 5 8 16 20 7 25 61
1 2 3 5 7 8 20 16 25 61
1 2 3 5 7 8 16 20 25 61
1 2 3 5 7 8 16 20 25 61

Start exploring endless computing possibilities with your own Raspberry Pi computer and accessories. Perfect for beginners and students.

sorted elements1 2 3 5 7 8 16 20 25 61


24 Responses to “C++ programs for sorting numbers in ascending order using Quick sort method”

  1. yeah not bad but sometime something missing becoz i m hacker so you need to prepare verry well either you gonna be hack
    i’m from IIN chamanpura jay hind bhart matki jay vande matram
    tum muje khoon do me tume aazadi dunga.
    Inkalab Zindabad

    Reply

Leave a Reply