Bubble Sorting Minimum – Algorithms & Data Structures in C++

#include<iostream>
#include<conio.h>
#include<iomanip>
#include<stdio.h>
#include<dos.h>

using namespace std;

void BubbleSort (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<<“\nEnter 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];
}

BubbleSort(arr, n);

cout<<“\nSorted Data “;
for (i = 0; i < n; i++)
cout<<“->”<<arr[i];
getch();
return 0;
}