SINGLE LOOP SORTING TECHNIQUE
#include <bits/stdc++.h>
using namespace std;
int main() {
int i,n,num,temp,til;
vector<int> a;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num;
a.push_back(num);
}
til=n;
for(i=0;i<til-1;i++)
{
if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
if(i==til-2)
{
for(i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<"\n";
til=til-1;
i=-1;
}
}
for(i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
return 0;
}
Comments
Post a Comment