插入排序

来源:互联网 发布:js粒子特效 编辑:程序博客网 时间:2024/05/29 11:05
#include <stdio.h>#include <stdlib.h>void swap(int *a ,int *b){int tmp = (*a);(*b) = (*a);(*a) = tmp;}void insert_sort(int data[], int size){for(int i=1; i<size; i++)/* size - 1 times*/{int tmp = data[i];int j;for(j=i-1; j>=0; j--){if(tmp < data[j]){data[j+1] = data[j];}else{break;}}data[j+1] = tmp;}}void display(int data[], int size){for(int i=0; i<size; i++){printf("%d ",data[i]);}printf("\n");}int main(){int data[] = {12,3,23,4,5,787,878,35,12};int size = sizeof(data)/sizeof(data[0]);display(data,size);insert_sort(data,size);display(data,size);return 0;}