C++ Programming Blog

 
 
 

Image

# include <iostream.h>
# include <conio.h>

int a[50],SIZE;
int i,j,key;
void qsort(int lb,int ub)
{
    while(1)
    {
        if(lb<ub)
        {
            i=lb;
            j=ub;
        }
        else
        {
            return;
        }
        key=a[lb];
        i++;
        while(a[i] <= key)
        {
            if(i==ub)
            {
                break;
            }
            i++;
        }

        while(a[j] > key)
        {
            if(j==lb)
            {
                break;
            }
            j--;
        }
        if(i < j)
        {
            int t=a[i];
            a[i]=a[j];
            a[j]=t;
        }
        else
        {
            break;
        }

    }
    int t=a[lb];
    a[lb]=a[j];
    a[j]=t;
    qsort(lb,j-1);
    qsort(j+1,ub);
}
void main()
{
    clrscr();

    cout<<\"Enter Size of an Array :\";
    cin>>SIZE;
    for(int i=0;i<SIZE;i++)
    {
        cout<<\"Enter Value for a[\"<<i<<\"] :\";
        cin>>a[i];
    }
    qsort(0,SIZE-1);

    for(i=0;i<SIZE;i++)
    {
        cout<<endl;
        cout<<\"\\t\\ta[\"<<i<<\"] :\"<<a[i];
    }
    getch();
}

 
 
Didn't find what you were looking for? Find more on Program to sort numbers using quick sort and bubble sort