Sorting Techniques

Sorting Techniques

/* Sorting ==> Bubble Sort technique */

#include<iostream.h>

#include<conio.h>

#define max 100

void main()

{

int arr[max], len, i, j, temp;

cout<<"Entre the size of array :\t";

cin>>len;

for(i=0; i<len; i++)

{

cout<<"Enter element "<<i+1<<" : ";

cin>>arr[i];

}

cout<<"\n Original array is :\n";

for(i=0; i<len; i++)

{

cout<<arr[i]<<" , ";

}

//Sorting starts here

for(i=0; i<len; i++)

{

for(j=0; j<len-1; j++)

{

if(arr[j] >arr[j+1])

{

temp = arr[j];

arr[j] = arr[j+1];

arr[j+1] = temp;

}

}

}

       //Sorting over

//Display sorted list

cout<<"Sorted array is :\n";

for(i=0; i<len; i++)

{

cout<<arr[i]<<"  ";

}

getch();

}

/* Sorting ==> Selection Sort technique */

#include<iostream.h>

#include<conio.h>

#define max 100

void main()

{

int arr[max], len, i, j, temp;

cout<<"Entre the size of array :\t";

cin>>len;

for(i=0; i<len; i++)

{

cout<<"Enter element "<<i+1<<" : ";

cin>>arr[i];

}

cout<<"\n Original array is :\n";

for(i=0; i<len; i++)

{

cout<<arr[i]<<" , ";

}

//Sorting starts here

         for(i=0; i<len-1; i++)

 {

               int low = arr[i];

               int p = a[i];

for(j=i+1; j<len; j++)

{

if(low>arr[i])

{

low = arr[i];

                                p = i;

}

}

         if(p != i)

         {

                temp = arr[i];

                arr[i] = arr[p];

                arr[p]=temp;

}

       }

       //Sorting over

//Display sorted list

cout<<"Sorted array is :\n";

for(i=0; i<len; i++)

{

cout<<arr[i]<<"  ";

}

getch();

}