//program for bubble sort

#include<iostream>

#include<stdlib.h>

using namespace std;

int main()

{

//By-Ghanendra Yadav

int *a,i,s,j,temp;

cout<<"ENTER THE SIZE OF ARRAY : \n"<<endl;

cin>>s;

a=(int*)malloc(s*sizeof(int));

cout<<"ENTER THE NUMBER\n"<<endl;

for(i=0;i<s;i++)

{

cout<<"ENTER THE ELEMENT "<<i+1<<" :";

cin>>a[i];

}

for(i=1;i<s;++i)

for(j=i;j>=1;--j)

if(a[j]<a[j-1])

{

temp = a[j];

a[j] = a[j-1];

a[j-1] = temp;

}

cout<<"\nSORTED ARRAY IN ACCENDING ORDER :\n\n"<<endl;

for(i=0;i<s;i++)

cout<<a[i]<<" ";

}

Output:-

#include<iostream>

#include<stdlib.h>

using namespace std;

int main()

{

//By-Ghanendra Yadav

int *a,i,s,j,temp;

cout<<"ENTER THE SIZE OF ARRAY : \n"<<endl;

cin>>s;

a=(int*)malloc(s*sizeof(int));

cout<<"ENTER THE NUMBER\n"<<endl;

for(i=0;i<s;i++)

{

cout<<"ENTER THE ELEMENT "<<i+1<<" :";

cin>>a[i];

}

for(i=1;i<s;++i)

for(j=i;j>=1;--j)

if(a[j]<a[j-1])

{

temp = a[j];

a[j] = a[j-1];

a[j-1] = temp;

}

cout<<"\nSORTED ARRAY IN ACCENDING ORDER :\n\n"<<endl;

for(i=0;i<s;i++)

cout<<a[i]<<" ";

}

Output:-

## 0 Comments: