希尔排序(减少增量值)
#include#include void ShellSort(int a[],int n) { int i,j,temp,in,key; in = n; while(in>1) { in=in/3+1; for(i=in;i =0) { if(key
文章标题:希尔排序(减少增量值)
文章源于:http://pwwzsj.com/article/iiiicg.html
#include#include void ShellSort(int a[],int n) { int i,j,temp,in,key; in = n; while(in>1) { in=in/3+1; for(i=in;i =0) { if(key
文章标题:希尔排序(减少增量值)
文章源于:http://pwwzsj.com/article/iiiicg.html