Sort by choice

#include<stdio.h>

int main()

{

int a[100];

int i,j,t,p,n;

while (~scanf("%d",& amp;n))

{

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

scanf("%d",&a[i]);

for (i=0;i<n-1;i++)

{

p=i;

for (j= i+1;j<n;j++)

if (a[p]>a[j])

p=j;

if (p!=j)

{

t=a[p];a[p]=a[i];a[i]=t;

}

}

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

if (i!=n-1)

printf("%d ",a[i]);

else

printf("%d\n",a[i]);

}

return 0;

}

Bubbling Sort

#include<stdio.h>

int main()

{

int i,j,t,n;int a[1000];

scanf("%d",&n);

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

scanf("%d",&a[i]);

for(j=0;j<(n-1);j++)

for(i=0;i<(n-1)-j;i++)

if(a[i]>a[i+1])

{t=a[i];a[i]=a[i+1];a[i+1]=t;}

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

{

if (i!=n-1)

printf("%d ",a[i]);

else

printf("%d\n",a[i]);

}

return 0;

}