Сравнить пузырьковую сортировку и сортировку Шелла

#include <stdio.h>
#include <conio.h>
#include <algorithm>
#include <stdlib.h>
 
void rand (int a[], int n)
{
int i;
for (i = 0; i < n; i++)
a[i] = rand() % n;
}
 
void up (int a[], int n)
{
int i;
for (i = 0; i < n; i++)
a[i] = i + 1;
}
 
void down (int a[], int n)
{
int i;
for (i = 0; i < n; i++)
a[i] = n - i;
}
 
int c=0;
int t=0;
 
void shell(int *items, int count)
{
  register int i, j, gap, k;
  int x, a[5];
 
  a[0]=9; a[1]=5; a[2]=3; a[3]=2; a[4]=1;
 
  for(k=0; k < 5; k++) {
    gap = a[k];
    for(i=gap; i < count; ++i) {
      x = items[i];
      for(j=i-gap; (x < items[j]) && (j >= 0); j=j-gap)
        items[j+gap] = items[j];
      items[j+gap] = x;
    }
  }
}
 
void vstavki_random (int a[], int n){
int i, j, k, q;
for (q=1; q<=100; q++)
{
rand (a, n);
for (i = 1; i < n; i++) {
c++;
k = a[i];
j = i - 1;
while (j >= 0 && a[j] > k)
{
c++; t++;
a[j + 1] = a[j];
j = j - 1;
a[j + 1] = k;
}
}}
}
 
int quickSortComp = 0;
int quickSortTrans = 0;
 
void bubble(int A[], int N) {
  
  int  i, j, c;
  
   for (i = 0; i < N-1; i ++){
    for (j = N-2; j >=  i ; j --)
      if ( A[j] > A[j+1] ) {
        c = A[j];
        A[j] = A[j+1];
        A[j+1] = c;
      }
  }
}
 
main(){
 
FILE *f;
 
f = fopen("zadacha.txt", "wt");
if ( f == NULL )
printf("error.");
 
printf("Please, wait");
 
int *mas;
int x = 5;
int y = 100;
int n = 5;
for (n; n<=y; n+=x)
{
mas = (int*)malloc(n*sizeof(int));
 
fprintf(f, "N = %d\n", n);
fprintf(f, "Luchshii slushai:\n");
up (mas,n);
shell (mas, n);
fprintf (f, "C(v): %d. T(v): %d.\n", c , t);
c=0;
t=0;
 
up (mas,n);
bubble (mas, n);
fprintf(f, "C(q): %d. T(q): %d.\n\n", quickSortComp, quickSortTrans);
quickSortComp = 0;
quickSortTrans = 0;
 
fprintf(f, "Hudhii slushai:\n");
down (mas, n);
shell (mas, n);
fprintf (f, "C(v): %d. T(v): %d.\n", c , t);
c=0;
t=0;
 
down (mas,n);
bubble (mas, n);
fprintf(f, "C(q): %d. T(q): %d.\n\n", quickSortComp, quickSortTrans);
quickSortComp = 0;
quickSortTrans = 0;
 
fprintf(f, "Uspeshnii slushai:\n");
vstavki_random(mas, n);
fprintf(f, "Uspeshnii  slushai:\n");
vstavki_random(mas, n);
fprintf (f, "C(v): %d. T(v): %d.\n", c/100 , t/100);
 
c=0; t=0;
 
for (int q=1; q<=100; q++)
{
rand (mas, n);
bubble (mas, n);
}
fprintf (f, "C(q): %d. T(q): %d.\n\n", quickSortComp/100 , quickSortTrans/100);
quickSortComp = 0;
quickSortTrans = 0;
}
fclose(f);
printf("\nfinish.");
getchar();
getchar();
}