void shellSort(int arr[], int size) {
int increment = size / 2;
for (int i = increment; i>2; i/=2) {
for (int j=0; j<i; ++j) {
insertionSort2(&arr[j], size-j, i);
}
}
insertionSort2(arr, size, 1);
}
int main()
{
int arr[5]={2,7,4,9,5};
int len = sizeof(arr)/sizeof(arr[0]);
int i;
printf("Before Sorting \n");
printArray(arr,0,len-1);
//Sorting
insertionSort2(arr,0,len -1);
printf("After Sorting \n");
printArray(arr,0,len-1);
return 0;
}
