SWUST數據結構--希爾排序算法實現

#include<iostream> using namespace std; int main(){ int i,n; int a[50]; cin>>n; for(i=0;i<n;i++) cin>>a[i]; for(i=0;i<n/2;i++) { int tmp; tmp = a[i]; a[i] = a[i+n/2]; a[i+n/2] = tmp;

>>阅读原文<<