Encryption/Decryption (Ceasar cipher)

Bubble Sort

#include<iostream>
using namespace std;
class bubblesort
{
int temp, array[],size;
public:
void sort(int array[],int size)
{

for(int i=0;i<size;i++)
{
for(int j=0;j<size-1-i;j++)
{
if(array[j]>array[j+1])
{
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
for(int j=0;j<size;j++)
 {
 cout<<array[j]<<" ";
 }
 cout<<endl;



}


};
int main()
{  bubblesort obj;

int size,array[size];
cout<<"enter array size"<<endl;
cin>>size;
cout<<" enter "<<size<<" element of array"<<endl;
for(int i=0;i<size;i++)
{

cin>>array[i];

}
obj.sort(array,size);

return 0;
}

Insertion Sort

#include<iostream>
using namespace std;
int main()
{
int size, a[100],temp,j,i;
cout<<"enter array size"<<endl;
cin>>size;
cout<<"enter array"<<endl;
for(i=0;i<size;i++)
{
cin>>a[i];
cout<<endl;
}
for(i=1;i<size;i++) // the zeroth index of this array sorting will remain untouch.
{
temp=a[i];
j=i-1;
while((j>=0)&& (a[j]>temp)) // if a[j](va,ue on zeroth index) have higher value than 1st index
{
a[j+1]=a[j];
j--;
}
a[j+1]=temp;
}
cout<<"sorted array"<<endl;
for(i=0;i<size;i++)
{
cout<<a[i]<<endl;
}
return 0;

}

Selection sort

#include<iostream>
using namespace std;
class selectionsort
{
int temp, min,i,j;
public:
void sort(int array[])
{ 

for( i=0;i<5;i++)
{
min=i;
for( j=1+i;j<5;j++)
if(array[min]>array[j])
min=j;
if(min!=i)
{
temp=array[i];
array[i]=array[min];
array[min]=temp;
}



}
cout<<"\nthe sorted array"<<endl;
for(int i=0;i<5;i++)
{
cout<<array[i]<<" ";
}

        }   
};
int main()
{  selectionsort obj;

int array[100],i;
cout<<" enter  element of array"<<endl;
for( i=0;i<5;i++)
{
cout<<" enter value:";
cin>>array[i];
cout<<endl;

}
cout<<"\nthe original array is"<<endl;
for( i=0;i<5;i++)
{

cout<<array[i]<<"  ";

}
obj.sort(array);

return 0;
}