我是 C 新手。我想在 C 中使用 hibbard 增量进行 shell 排序实验。而且,为了测试最坏的情况,我总是根据输入大小构建一个反向数组。我希望看到时间复杂度 O(n^1.5) 之后的运行时间。但是,我的输出以某种方式遵循时间复杂度 O(n)。以下是我的代码。如果有人可以帮助我找到问题所在,我将不胜感激。
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <math.h>
int get_input() {
int input;
printf("Please type input size(n): ");
if(scanf("%d", &input) == 0) {
fscanf(stdin, "%*[^\n]%*c");
}
return input;
}
int* build_data(int* array, int size) {
array = malloc(sizeof(int) * size);
for(int i=0; i < size; i++) {
array[i] = size - i;
}
return array;
}
double record_time(int* array, int size, void (*fp)(int*, int)) {
clock_t begin = clock();
(*fp)(array, size);
clock_t end = clock();
return (double)(end - begin) / CLOCKS_PER_SEC;
}
void shell_sort(int* array, int size) {
int* h_inc;
int h_size;
h_size = floor(log(size+1)/log(2));
h_inc = malloc(sizeof(int) * h_size);
for(int i=0; i < h_size; i++) {
h_inc[i] = pow(2, i+1) - 1;
}
int i, j, tmp;
for (int r = (h_size - 1); r >= 0; r--) {
int gap = h_inc[r];
for(i = gap; i < size; i++) {
tmp = array[i];
for(j = i; j >= gap && tmp < array[j-gap]; j-=gap) {
array[j] = array[j-gap];
}
array[j] = tmp;
}
}
free(h_inc);
return;
}
int main() {
while(1) {
int size;
int* data;
double time_elapsed;
size = get_input();
if (size <= 0) { break; }
data = build_data(data, size);
time_elapsed = record_time(data, size, shell_sort);
printf("Elapsed time: %f sec\n", time_elapsed);
free(data);
}
return 0;
}
我的输出是:
Please type input size(n): 10000
Elapsed time: 0.001168 sec
Please type input size(n): 50000
Elapsed time: 0.006094 sec
Please type input size(n): 100000
Elapsed time: 0.010946 sec
Please type input size(n): 500000
Elapsed time: 0.054341 sec
Please type input size(n): 1000000
Elapsed time: 0.118640 sec
Please type input size(n): 5000000
Elapsed time: 0.618815 sec
Please type input size(n): 10000000
Elapsed time: 1.332671 sec