C++ program to implement Quick sort Algorithm using class

Editorial Team — Tue, 01 Feb 2011 13:35:44 +0000

#include 
const int MAX = 10 ;
class array
{
	private :

		int arr[MAX] ;
		int count ;
	public :

		array( ) ;
		void add ( int item ) ;
		int getcount( ) ;
		static int split ( int *, int, int ) ;
		void quiksort ( int lower, int upper ) ;
		void display( ) ;
} ;
array :: array( )
{
	count = 0 ;
	for ( int i = 0 ; i < MAX ; i++ )
		arr[i] = 0 ;
}
void array :: add ( int item )
{
	if ( count < MAX )
	{
		arr[count] = item ;
		count++ ;
	}
	else
		cout << "\nArray is full" << endl ;
}
int array :: getcount( )
{
	return count ;
}
void array :: quiksort ( int lower, int upper )
{
	if ( upper > lower )
	{
		int i = split ( arr, lower, upper ) ;
		quiksort ( lower, i - 1 ) ;
		quiksort ( i + 1, upper ) ;
	}
}
int array :: split ( int *a, int lower, int upper )
{
	int i, p, q, t ;

	p = lower + 1 ;
	q = upper ;
	i = a[lower] ;
	while ( q >= p )
	{
		while ( a[p] < i )
			p++ ;
		while ( a[q] > i )
			q-- ;
		if ( q > p )
		{
			t = a[p] ;
			a[p] = a[q] ;
			a[q] = t ;
		}
	}
	t = a[lower] ;
	a[lower] = a[q] ;
	a[q] = t ;
	return q ;
}
void array :: display( )
{
	for ( int i = 0 ; i < count ; i++ )
		cout << arr[i] << "  " ;
	cout << endl ;
}
void main( )
{
	array a ;
	a.add ( 11 ) ;
	a.add ( 2 ) ;
	a.add ( 9 ) ;
	a.add ( 13 ) ;
	a.add ( 57 ) ;
	a.add ( 25 ) ;
	a.add ( 17 ) ;
	a.add ( 1 ) ;
	a.add ( 90 ) ;
	a.add ( 3 ) ;
	cout << "\nQuik sort.\n" ;
	cout << "\nArray before sorting:" << endl ;
	a.display( ) ;
	int c = a.getcount( ) ;
	a.quiksort ( 0, c - 1 ) ;
	cout << "\nArray after quick sorting:" << endl ;
	a.display( ) ;
}

The post C++ program to implement Quick sort Algorithm using class first appeared on Student Projects.

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

Editorial Team — Thu, 11 Mar 2010 17:27:51 +0000

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

#include
#include
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(lp && 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 <
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 
sorted elements1 2 3 5 7 8 16 20 25 61
The post C++ programs for sorting numbers in ascending order using Quick sort method first appeared on Student Projects.

Quick sort | Student Projects

C++ program to implement Quick sort Algorithm using class

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