Sorting an array - Insertion Sort

InsertionSort.c

#include <stdio.h>

int swap(int* i, int* j){
    int temp = *i;
    *i = *j;
    *j = temp;
}

int InsertionSort(int array[], int size){
    for (int i =1 ; i < size ; i++){
        int temp = i;
        int j = i-1;
        while(j>=0 && array[j]>array[i]){
            swap(&array[j+1],&array[j]);
            j = j-1;
            i = i-1;
        }
        i = temp;
        //Uncomment this to see changes after every loop
        //for (int k = 0 ; k<size; k++){
        //    printf("%d ", array[k]);
        //}
        //printf("\n");
    }
}

void print(int array[], int size){
    for (int i = 0 ; i<size ; i++){
        printf("%d\n",array[i]);
    }
}

void main() {
    int array[] = {9,8,7,6,5,4,3,2,1,0};
    int size = sizeof(array)/sizeof(array[0]);
    InsertionSort(array,size);
    print(array,size);
}