交换法排序

版权声明：由陈庚汝编辑 https://blog.csdn.net/ChenGengru/article/details/84533571

#include<stdio.h>
#include<stdlib.h>
/* 插入排序法 */
/* written by Chen Gengru */
/* updated on 2018-11-26 */
int main()
{
	int i, j;
	int a[10];
	int iTemp;
	
	for (i = 0; i < 10; i++)
	{
	
		scanf("%d", &a[i]);
}
	
	for (i = 0; i < 9; i++)
	{
		for (j = i+1; j < 10; j++)
		{
			if (a[i] > a[j])
			{
				iTemp = a[i];
				a[i] = a[j];
				a[j] = iTemp;
			}
		}
	}