Bubble Sort in C++ with improvements

Here is an example of Bubble sort in C++.  The example will perform bubble sort on a set of 10 integers. The example is a OO example . So everything is in a class called bubble. The class it self has following methods in it.

• set() This will allow to set the values in the array.
• show() This will display the given array.
• sort1() normal bubble sorting.
• sort2() improved bubble sorting.

Bubble sort : The sort is a very easy to implement sort method that compares the element to its next element. If the element is bigger then the first element then it is swapped with next element. The name bubble sort comes from the fact, the method is similar to bubble rising in water. As lighter bubble come up and heavy bubble fall down. So if you have numbers like
41,13,53,6
first 41 will be checked against 13. Since its bigger then 13 so it will be replaced with 13.
13,41,53,6
Now 2nd element which happens to be 41 will be compared to 53. since its smaller then 53 so we do nothing.
13,41,53,6
Next compare the next element 53 with 6. Since it is bigger then 6, it will be replaced by 6..
13,41,6,53
This is over result after First pass. Notice how the biggest element is at last position already. So we won't bother about it . Next we will repeat the process for the other elements.
After second pass
13,6,41,53
after 3rd pass 
6,13,41,53
Hence the array gets sorted.
Improvement : So how can bubble sorting be improved. Well the improvement can only happen if in between the passes the array gets sorted out. So when this happens we don't need to proceed checking the whole passes. How to detect if the array was sorted ?? well if there are no exchange of variables in any pass that means the array elements are already sorted out. We can use a variable "swap"  , we will set it to 0 just before any pass. and we will set it to 1 if any exchange happens. after the pass we will check its value, if its 0 that means no exchange happened so the array is already sorted by bubble sort. and we can break from there.
code:

#include<iostream>

using namespace std;

class bubble
{
    // 10 element of type int
    int a[10];
    
    public:
    bubble()
    {
        //default constructor sets all elements to 0
        for(int x=0;x<10;x++)
        {
            a[x]=0;
        }
    }
    void set()
    {
        cout<<"\n Enter Elements of Array=";
        for(int x=0;x<10;x++)
        {
            cout<<"\nEnter"<<x+1<<" Item=";
            cin>>a[x];
        }
    }
    void show()
    {
        cout<<"\n Printing Array=";
        for(int x=0;x<10;x++)
        {
            cout<<"\n"<<a[x];
        }
    }
    void sort1()
    {
        int moves=0;
        
        for(int x=0;x<10;x++)
        {
            for(int y=0;y<10-x-1;y++)
            {
                //compare the 2 near values
                // move the bigger one down by swapping
                if(a[y]>a[y+1])
                {
                    //swapping by a third variable
                    int t=a[y];
                    a[y]=a[y+1];
                    a[y+1]=t;    
                    
                }
                //count moves
                    moves++;
                
            }
        }
        cout<<"\n array sorted with "<<moves<<" moves";
    }
    void sort2()
    {
        int moves=0;
        int swap=0;
        for(int x=0;x<10;x++)
        {
            //set variable swap to 0
            swap=0;
            for(int y=0;y<10-x-1;y++)
            {
                //compare the 2 near values
                // move the bigger one down by swapping
                if(a[y]>a[y+1])
                {
                    //swapping by a third variable
                    int t=a[y];
                    a[y]=a[y+1];
                    a[y+1]=t;    
                    //if swapping is done set swap to 1
                    swap=1;
                    
                }
                //count moves
                    moves++;
                    
                
            }
            if(swap==0)
            {
                // break the loop if no swapping were done 
                // this will only happen if the array was sorted already
                break;
            }
        }
        cout<<"\n array sorted with "<<moves<<" moves";
    }
};

int main()
{
    bubble b;
    b.set();
    b.show();
    b.sort2();
    b.show();
}