摘要：void ShellSort ( vector<int> &v ) { int P = 4; int m[] = {5,3,2,1}; for ( int idx = 0; idx < P; idx++ ) { int len = m[idx]; for ( int sec = 1; sec < ( v.size()/len + ( v.size()%len != 0 ) ); sec++ ) { int end = ( sec*len + len ) < v.size() ? ( sec*len + len ) : v.si... 阅读全文

摘要：#include <stdio.h>#include <stdlib.h>#define L 10int array[L] = {0};int Partition ( int *R, int low, int high ) { int pot = high; int i = low; while ( i < pot ) { if ( R[i] > R[high] ) { int tmp = R[i]; R[i--] = R[--pot]; R[pot] = tmp; } ... 阅读全文

摘要：Hello World ! 阅读全文