快速排序算法代码实现

1. /*
2018年1月5日 20:40:24
本程序用于插入排序算法实现
源算法描述
for j = 2 to A.length
key = A[j]
//Insert A[j] to thesorted sequence A[1...j-1]
i = j - 1;
while i >0 and A[j] > key
A[i+1] = A[i]
i = i -1
A[i+1] = key
 
*/ 
#include
void InsertionSort(int *a, int len); 


int main(void) {
int i;
int a [] = {4,2,7,6,8,12,14,9};
InsertionSort(a,sizeof(a) / 4);
for(i =0; i < sizeof(a) / 4; i++){
printf("%-4d",a[i]); 
}
return 0;
}

void InsertionSort(int *a, int len)  
{  
int i, j, k;
int key; 
    for(j = 1; j < len ; j++){
key = a[j];
i = j - 1;
while( i>= 0 && a[i] >key){
a[i+1] = a[i];
i--;
}
a[i+1] = key;
}
}