Source Code :
#include<iostream>
using namespace std;
void Bublesort (int arr[], int n)
{
int i,j;
for(i=0;i<n;++i)
{
for(j=0;j,n-i-1;++j)
{
if(arr[j]>arr[j+1])
{
arr[j] = arr[j]+arr[j+1];
arr[j+1] = arr[j]-arr[j+1];
arr[j] = arr[j]-arr[j+1];
}
}
}
}
int main()
{
int n, i;
cout<<"Enter the number of data element to be sorted: ";
cin>>n;
int arr[n];
for(i=0;i<n;i++)
{
cout<<"Enter element "<<i+1<<": ";
cin>>arr[i];
}
Bublesort(arr,n);
cout<<"Sorted Data ";
for(i=0;i<n;i++)
cout<<"_>"<<arr[i];
return 0;
}
Program Output :
0 Comments