8/14/2019 Different Sorting Algorithms

1/7

Different Sorting Algorithms============================================#include

/////////////////////CLASS SORTING//////////////class Sorting{

public:///////SORTING FUCTION//////

void Bubble(int a[],int);

void Bucket(int a[],int,int);void Cocktail(int a[],int);void Gnome(int a[],int);void Insertion(int a[],int);

void mergeSort(int,int);int QSort(int a[],int,int);

void Selection(int a[],int);

void Shell(int a[],int);void Print(int a[],int);};

//////////////////////BUBBLE SORT//////////////void Sorting::Bubble(int a[],int n){

int swap=0;for(int i=0;ii;j--){

if(a[j]

8/14/2019 Different Sorting Algorithms

2/7

for(i=0,j=0;j0;k--)

a[i++]=j;}

///////////////////COCKTAIL SORT//////////////void Sorting::Cocktail(int A[],int n){

int left=0,right=n;bool flag;

do{flag=true;

--right;for (int i=left;iA[i+1]){int t;

t=A[i];

A[i]=A[i+1];A[i+1]=t;

flag = false;}

if (flag)return;

flag = true;for (i=right;i>left;i--)

if (A[i]

8/14/2019 Different Sorting Algorithms

3/7

}

}}

///////////////////INSERTION SORT//////////////void Sorting::Insertion(int a[],int n){

for (int i=0;i0) && (a[j]

8/14/2019 Different Sorting Algorithms

4/7

}

if(h>mid){for(k=j;k

8/14/2019 Different Sorting Algorithms

5/7

QSort(a,i+1,end);

}/////////////////////SELECTION SORT//////////////

void Sorting::Selection(int a[],int n){int min,temp;

for(int i=0;i

8/14/2019 Different Sorting Algorithms

6/7

couta[i];}

//for(;;){cout

8/14/2019 Different Sorting Algorithms

7/7

s.QSort(a,0,7);

s.Print(a,i);}

else if(ch==8){s.Selection(a,i);

s.Print(a,i);}else if(ch==9){

s.Shell(a,i);

s.Print(a,i);}

// }}

http://www.ravianeducation.blogspot.comFARHAN: 03008855006