【算法】插入排序 (图解+代码)

#include<stdio.h>
void insertion_sort_As(int a[], int n);//升序
void insertion_sort_Des(int a[], int n);//降序
int main(int argc, char const *argv[])
{

	int	a[10]={9,1,8,2,7,3,6,4,5,0};
	int i;
	insertion_sort_As(a,10);
	for(i=0,printf("Ascending:\n");i<10;i++)	printf("%3d",a[i]);
	insertion_sort_Des(a,10);
	for(i=0,printf("\nDescending:\n");i<10;i++)	printf("%3d",a[i]);
	return 0;
}
void insertion_sort_As(int a[], int n){
    int i,j,tmp;  
    for (i = 1; i < n; i++) {  
        tmp = a[i];  
        for (j = i - 1; j >= 0 && a[j] > tmp; j--) {//向后移动元素
            a[j+1] = a[j];  
        }  
        a[j+1] = tmp;  
    }  
} 
void insertion_sort_Des(int a[], int n){
	int i,j,tmp;  
    for (i = n-1; i>=0; i--) {  
        tmp = a[i];  
        for (j = i +1; j <=n && a[j] > tmp; j++) {//向前移动元素
            a[j-1] = a[j];  
        }  
        a[j-1] = tmp;  
    } 
}