#define _CRT_SECURE_NO_DEPRECATE
 
#include <stdio.h>
#include <stdlib.h>
 
#include "sort.h"
 
 
int main(void)
{
  int n;
  int *A = NULL, *A_copy = NULL;
  int sort_ascending, random;
  work_counter work;
 
  int i;
 
  /* Read in the sequence length */
  printf("Enter the length of the sequence: ");
  scanf("%d", &n);
 
  /* Allocate memory for arrays */
  A = (int *)malloc(n*sizeof(int));
  A_copy = (int *)malloc(n*sizeof(int));
  if ((A == NULL) || (A_copy == NULL))
  {
    printf("Not enough memory available\n");
    exit(EXIT_FAILURE);
  }
 
  /* Determine sequence type */
  printf("Enter 0 for a given seqence, 1 for a random sequence: ");
  scanf("%d", &random);
 
  if (random)
  {
    /* Generate random sequence */
    printf("Generating random integers in range [%d,%d]\n", 0, RAND_MAX);
    for (i = 0; i < n; i++)
    {
      A[i] = rand();
      A_copy[i] = A[i];
    }
  }
  else
  {
    /* Read in given sequence */
    printf("Enter given sequence\n");
    for (i = 0; i < n; i++)
    {
      scanf("%d", &(A[i]));
      A_copy[i] = A[i];
    }
  }
 
  /* Determine sequence ordering */
  printf("Enter 0 to sort descending, 1 to sort ascending: ");
  scanf("%d", &sort_ascending);
 
  /* Output original sequence */
  printf("*** Original sequence\n");
  printf("A = [ ");
  for(i = 0; i < n; i++)
    printf("%d ",A[i]);
  printf("]\n");
  printf("\n");
 
  /* Perform insertion sort */
  printf("*** Insertion sort\n");
 
  work.comparisons = 0;
  work.swaps = 0;
 
  insertion_sort(n,A,1,sort_ascending,&work);
 
  printf("A = [ ");
  for(i = 0; i < n; i++)
    printf("%d ",A[i]);
  printf("]\n");
  printf("comparisons = %d, swaps = %d\n", work.comparisons, work.swaps);
  printf("\n");
 
  /* Perform Shells sort */
 
  /* Free allocated memory */
  free(A); A = NULL;
  free(A_copy); A_copy = NULL;
 
  return 0;
}

/* Create an operations counter variable type */
struct work_counter_struct 
{
  int comparisons;
  int swaps;
};
 
typedef struct work_counter_struct work_counter;
 
 
/*
 * Shells sort routine
 */
void shells_sort(int n, int *A, int sort_ascending, work_counter *work);
 
 
/*
 * Insertion sort routine
 */
void insertion_sort(int n, int *A, int inc, int sort_ascending, work_counter *work);

void shells_sort(int n, int *A, int sort_ascending, work_counter *work);

void insertion_sort(int n, int *A, int inc, int sort_ascending, work_counter *work);

insertion_sort(n,A,1,sort_ascending,&work);

// Filename : sort.c
#include "sort.h"
 
 
void shells_sort(int n, int *A, int sort_ascending, work_counter *work)
{
}
 
 
void insertion_sort(int n, int *A, int inc, int sort_ascending, work_counter *work)
{
}

#include <stdio.h>
 
void insertion_sort(int A[6], int n)
{
	int i, j, key;
 
	for(j = 2; j<n; j++)
	{
		key = A[j];
		i = j-1;
		while((i > 0) && (A[i] > key));
		{
			A[i + 1] = A[i];
			i=i-1;
		}
			A[i+1]=key;
	}
 
	for(key = 0; key < n; key++)
{
	printf("%d", A[key]);
 
}
	}
 
int main(void)
{
	int A[6]={5,2,4,6,1,3};
	int n=6;
 
	insertion_sort(A,n);
}

while((i > 0) && (A[i] > key))
{
    ;
}