C++ (Cpp) Shellsort示例

示例#1

文件： sort_algorithm_performance_int.cpp 项目： denjai/TU-Plovdiv

int main()
{t_element A[N];
t_element n;
int q,r,s,m=0,i;


for(i=0;i<N;i++)
	A[i]=rand()*0.1;
r=GetTickCount();
mehurche(N,A);
s=GetTickCount();
q=s-r;
printf("\nmetod na mehurcheto; %d",q);

for(i=0;i<N;i++)
	A[i]=rand()*0.1;
r=GetTickCount();
qs(A,0,N-1);
s=GetTickCount();
q=s-r;
printf("\nquicksort; %d",q);




for(i=0;i<N;i++)
	A[i]=rand()*0.1;
r=GetTickCount();
Shellsort(A,N);
s=GetTickCount();
q=s-r;
printf("\nshell; %d",q);

for(i=0;i<N;i++)
	A[i]=rand()*0.1;
r=GetTickCount();
sort_vmykvane(N,A);
s=GetTickCount();
q=s-r;
printf("\nvmukvane; %d",q);

for(i=0;i<N;i++)
	A[i]=rand()*0.1;
r=GetTickCount();
sort_vmykvane_d(N,A);
s=GetTickCount();
q=s-r;
printf("\ndvoichno vmukvane; %d",q);






getch();
return 0;
}

示例#2

文件： 8640 希尔(shell)排序.cpp 项目： JakLiao/Mycode

int main()
{
    SqList L;
    int n,i;
    scanf("%d",&n);
    for(i=1; i<=n; i++) {
        scanf("%d",&L.r[i]);
    }
    L.length=n;
    Shellsort(L,n);
    return 0;
}