mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2025-04-12 08:22:59 +03:00
Code Issues Packages Projects Releases Wiki Activity

Update shellSort.c

Browse Source
This commit is contained in:
Libin Yang 2019-05-05 15:34:27 +08:00 committed by GitHub
parent 1abb8b20bb
commit cef21ccea9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 34 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

68
sorting/shellSort.c
View File

@ -3,7 +3,7 @@
#include <time.h>
#define ELEMENT_NR 20
#define ARRAY_LEN(x) (sizeof(x)/sizeof((x)[0]))
#define ARRAY_LEN(x) (sizeof(x) / sizeof((x)[0]))
const char *notation = "Shell Sort Big O Notation:\
\n--> Best Case: O(n log(n)) \
\n--> Average Case: depends on gap sequence \
@ -11,58 +11,58 @@ const char *notation = "Shell Sort Big O Notation:\
void show_data(int arr[], int len)
{
int i;
int i;
for (i = 0; i < len; i++)
printf("%3d ", arr[i]);
printf("\n");
for (i = 0; i < len; i++)
printf("%3d ", arr[i]);
printf("\n");
}
void swap(int *a, int *b)
{
int tmp;
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void shellSort(int array[], int len)
{
int i, j, gap;
int i, j, gap;
for (gap = len / 2; gap > 0; gap = gap / 2)
for (i = gap; i < len; i++)
for (j = i - gap; j >= 0 && array[j] > array[j + gap]; j = j - gap)
swap(&array[j], &array[j + gap]);
for (gap = len / 2; gap > 0; gap = gap / 2)
for (i = gap; i < len; i++)
for (j = i - gap; j >= 0 && array[j] > array[j + gap]; j = j - gap)
swap(&array[j], &array[j + gap]);
}
int main(int argc, char *argv[])
{
int i;
int array[ELEMENT_NR];
int range = 500;
int size;
clock_t start, end;
double time_spent;
int i;
int array[ELEMENT_NR];
int range = 500;
int size;
clock_t start, end;
double time_spent;
srand(time(NULL));
for (i= 0; i < ELEMENT_NR; i++)
array[i] = rand() % range + 1;
srand(time(NULL));
for (i = 0; i < ELEMENT_NR; i++)
array[i] = rand() % range + 1;
size = ARRAY_LEN(array);
size = ARRAY_LEN(array);
show_data(array, size);
start = clock();
shellSort(array, size);
end = clock();
time_spent = (double)(end - start) / CLOCKS_PER_SEC;
show_data(array, size);
start = clock();
shellSort(array, size);
end = clock();
time_spent = (double)(end - start) / CLOCKS_PER_SEC;
printf("Data Sorted\n");
show_data(array, size);
printf("Data Sorted\n");
show_data(array, size);
printf("%s\n", notation);
printf("Time spent sorting: %f\n", time_spent);
printf("%s\n", notation);
printf("Time spent sorting: %f\n", time_spent);
return 0;
return 0;
}