Bubble Sort - Implementation with C++

/* Bismillahir Rahmanir Rahim Implementation of Bubble-Sort using C++ */ #include<bits/stdc++.h> using namespace std; int main(){ int a[50],n,i,j,temp; cin>>n; // Enter the number of element for(i=0; i<n; i++) cin>>a[i]; // Enter all elements for(i=1; i<n; i++){ for(j=0; j<(n-i); j++){ if(a[j]>a[j+1]){ temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } } for(i=0; i<n; i++) cout<<a[i]<<" "; cout<<endl; return 0; }