123 Eng

Engineering the engineers™


Latest Jobs   Forum Map

 


Home
Source Codes
Engineering Colleges

Training  Reports
Seminar Reports
Placement Papers

Forums

   Computer Science / IT
   Electronics
   Electrical
   Mechanical
   Chemical
   Civil

   CAT / MBA

   GMAT / Foreign MBA
Latest Jobs

Engineering Jobs / Technical Jobs
Management Jobs

Sitemap
Terms of use

Displaying  Source Code(s)  
 

 
--------------------------------------------------------------------------------

Quick Sort Implementation

--------------------------------------------------------------------------------

Description : The following is the code in which i have implemented Quick
sort(fastest sortin algorithm)Time Complexity-n*(logn)..
go thrgh the code and it is free for use.any comments abt the code are
welcome



/*Quick Sort Algorithm developed by Vivek Tiwari 27-6-2004*/
#include<process.h>
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>

int Partition(int low,int high,int arr[]);
void Quick_sort(int low,int high,int arr[]);

void main()
{
int *a,n,low,high,i;
clrscr();
cout<<"/**************************Quick Sort Algorithm
Implementation*****************/
<BR>;
cout<<"Enter number of elements:<BR>;
cin>>n;

a=new int[n];
/* cout<<"enter the elements:<BR>;
for(i=0;i<n;i++)
cin>>a;*/
for(i=0;i<n;i++)
a[i]=rand()%100;
clrscr();
cout<<"
Initial Order of elements<BR>;
for(i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<"<BR>;

high=n-1;
low=0;
Quick_sort(low,high,a);
cout<<"
Final Array After Sorting:<BR>;

for(i=0;i<n;i++)
cout<<a[i]<<" ";

getch();
}

/*Function for partitioning the array*/

int Partition(int low,int high,int arr[])
{ int i,high_vac,low_vac,pivot/*,itr*/;
pivot=arr[low];
while(high>low)
{ high_vac=arr[high];

while(pivot<high_vac)
{
if(high<=low) break;
high--;
high_vac=arr[high];
}

arr[low]=high_vac;
low_vac=arr[low];
while(pivot>low_vac)
{
if(high<=low) break;
low++;
low_vac=arr[low];
}
arr[high]=low_vac;
}
arr[low]=pivot;
return low;
}

void Quick_sort(int low,int high,int arr[])
{
int Piv_index,i;
if(low<high)
{
Piv_index=Partition(low,high,arr);
Quick_sort(low,Piv_index-1,arr);
Quick_sort(Piv_index+1,high,arr);
}
}

 

 

 

Contribute content or training reports / feedback / Comments
job placement papers
All rights reserved copyright 123ENG