20:55
Unknown
Algorithm of Quick Sort
QuickSort(a,beg,end) // a is Array
{
if(beg<end)
{
p=Partition(a,beg,end); //Calling Procedure to Find Pivot
QuickSort(a,beg,p-1); //QuickSort Calls Itself
QuickSort(a,p+1,end); //(Divides the List into two Sub Lists)
}
}
Procedure to Find Pivot :-
Partition(a,beg,end)
{
p=beg, pivot=a[beg];
for loc=beg+1 to end;
{
if(pivot>a[loc])
{
a[p]=a[loc];
a[loc]=a[p+1];
a[p+1]=pivot;
p=p+1;
}
}
return p;
}
Program in C++ --- Quick Sort
#include<iostream>
#include<conio.h>
using namespace std;
int Partition(int a[], int beg, int end) //Function to Find Pivot Point
{
int p=beg, pivot=a[beg], loc;
for(loc=beg+1;loc<=end;loc++)
{
if(pivot>a[loc])
{
a[p]=a[loc];
a[loc]=a[p+1];
a[p+1]=pivot;
p=p+1;
}
}
return p;
}
void QuickSort(int a[], int beg, int end)
{
if(beg<end)
{
int p=Partition(a,beg,end); //Calling Procedure to Find Pivot
QuickSort(a,beg,p-1); //Calls Itself (Recursion)
QuickSort(a,p+1,end); //Calls Itself (Recursion)
}
}
void main()
{
int a[100],i,n,beg,end;
cout<<"\n------- QUICK SORT -------\n\n";
cout<<"Enter the No. of Elements : ";
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
beg=1;
end=n;
QuickSort(a,beg,end); //Calling of QuickSort Function
cout<<"\nAfter Sorting : \n";
for(i=1;i<=n;i++)
{
cout<<a[i]<<endl;
}
getch();
}
Output :-
Below
is a listing of our top 10 favorite Twitter tips and tricks. These tips will
help make your Twitter experience more enjoyable and can help increase your
followers.
Twitter
lists are an excellent method of filtering filter through the people you follow.
To create a list, click the Lists link and then Create a list.
After creating a list visit the persons profile page you wish to add and click
the list icon, as shown in the picture to the right. Our
Computers
and Tech list is an example of a public list we created.
