#include<iostream>

using namespace std;

class Numbers

{

    int *list;

    int n,size;

public:

    Numbers(int s)

    {

        size=s;

        list=new int[size];

    }

    void read()

    {

        cout<<"enter the number of elements";

        cin>>n;

        cout<<"enter the elements:";

        for (int **0;i<n;i++){

            cin>>list[i];

        }

    }

   void display()

   {

            cout<<" the elements are:";

        for (int **0;i<n;i++){

            cout<<list[i]<<"\t";

        }

   }

   void QuickSort(int lb,int ub)

{         int  key,i,j,t;

    if(lb>=ub)    return; // list with less than two elements

    key=list[lb]; **lb+1; j=ub;

    do

    {

        while(i<=ub && list[i]<key) i++;

        while(j>=lb && list[j]>key)  j--;

        if(i<j)

        {

            t=list[i];

            list[i]=list[j];

            list[j]=t;

        }

    }while(i<j);

    t=list[lb];

    list[lb]=list[j];

    list[j]=t;

     QuickSort(lb,j-1);

    QuickSort(j+1,ub);

}

int getn()

{

    return n;

}

void bubblesort()

{

for(int **0;i<n-1;i++) //loop for n-1 passes

for(int j=0;j<n-1-i;j++)//loop for comparison and swaping adjacent members

if(list[j]>=list[j+1])

{

list[j]+=list[j+1],

list[j+1]=list[j]-list[j+1],

list[j]=list[j]-list[j+1];    // interchange without using temp variable

}            // or use a simple interchange function using temp

}

};

int main()

{

    Numbers n1(10);

    n1.read();

    n1.display();

    cout<<"\n";

    n1.QuickSort(0,n1.getn()-1);

    cout<<"\n";

    n1.display();

    cout<<"\n";

    n1.read();

    n1.display();

    cout<<"\n";

    n1.bubblesort();

    cout<<"\n";

    n1.display();

}