/* Weiss used 1-n as the indices of the array rather than 0 to n-1 Also, he 
modified the Ada version quite a bit so that it would "work" in C. In the Ada 
version he used "and then" to force what is called short- circuit evaluation. 
All C comparisons use short-circuit evaluation so the algorithm did NOT need to 
be changed. */ 

#include <stdio.h>

void shellsort(int a[], int n)
{
  int i, j, increment;
  int temp;
 
  for (increment = n/2; increment > 0; increment /= 2)
  {
     for (i = increment; i < n; i++) /*changed this line*/
     {
        temp = a[i];
        j = i; 
        while ((j>=increment)&&(temp<a[j-increment]))
        {
          a[j] = a[j-increment];
          j -= increment;
        }
        a[j] = temp;
      }
  }
}

void print(int a[], int high)
{
  int i;
  for (i = 0; i < high; i++)
  {
     printf("%d ",a[i]);
  }
}

void main(void)
{
  int array[13]={81, 94, 11, 96, 12, 35, 17, 95, 28, 58, 41, 75, 15};

  shellsort(array, 13);
  print(array,13);
}