one algorithm a day keeps the doctor away -- ShellSort

#include<stdio.h>

int main()
{

    void ShellSort(int array[],int n,int intval);
    int array[10] = {58,112,968,235,74,36,1,8,56,1035};
    int intval = 2;
    for(int iter = intval; iter >= 1;iter --)
    {
        ShellSort(array,10,iter);
    }
    for(int iter = 0;iter < 10;iter ++)
    {
        printf("%d ",array[iter]);
    }
    return 0;
}

void ShellSort(int array[],int n,int intval)
{
    int temp;


    for(int key = 0;key < intval;key ++)
    {

    for(int iter = intval + key ;iter < n;iter = iter + intval)
    {
        temp = array[iter];
        int jter;
        for(jter = iter - intval;jter >= 0&&array[jter] > temp;jter = jter - intval)
        {
                    array[jter + intval] = array[jter];

        }

                    array[jter + intval] = temp;

    }
    }
}