代码

#include <algorithm>

// Shell Sort
// Will it TLE?
void sort(unsigned *a, int n) {
  for (int m = n; m = m * .6; ) {
    for (int i = m; i < n; ++i) {
      int k = i;
R:    if (a[k-m] > a[k]) {
        std::swap(a[k-m], a[k]);
        k -= m;
        if (k >= m) {
          goto R;
        }
      }
    }
  }
}

评测结果