插入排序算法

#include <stdio.h>


void print_array(int * arr, int size){
    int i;
    printf("\n==========start===========\n");
    for(i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n===========end============\n");
}

void insert_sort(int * arr, int size){
    int i, j;
    for(i = 1; i < size; i++) {
        print_array(arr, size);
        int temp = arr[i];
        for(j = i-1; j>=0; j--) {
            if(arr[j] > temp){
                arr[j+1] = arr[j];
            } else {
                break;
            }
        }
        arr[j+1] = temp;
    }
}

int main(int argc, const char * argv[]) {
    int size = 7;
    int arr[] = {12,2,23,55,4,76,85};
    insert_sort(arr, size);
    print_array(arr, size);
    return 0;
}