排序

#include<stdio.h>int main(){int t=0,i=0,j=0;int a[10];for(i=0;i<10;i++) scanf("%d ",&a[i]);for(i=1;i<10;++i){for(j=i;j>=1;j--){if(a[j]<a[j-1]){t=a[j];a[j]=a[j-1];a[j-1]=t;}}}for(i=0;i<9;i++){printf("%d<",a[i]);}printf("%d",a[9]);printf("\n");return 0;}

<pre name="code" class="cpp"><img src="http://img.blog.csdn.net/20150417064750023?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvZGgwMTQ0Mjk4/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />

#include<stdio.h>#define N 10int main(){int t=0,i=0,j=0;int a[N]={7,8,6,5,12,13,456,17,45,-89};for(i=1;i<N;++i){for(j=i;j>=1;j--){if(a[j]<a[j-1]){t=a[j];a[j]=a[j-1];a[j-1]=t;}}}for(i=0;i<9;i++){printf("%d<",a[i]);}printf("%d",a[9]);printf("\n");return 0;}