void twoWaysInsertSort(int[] seq) {\n int length = seq.length;\n int[] _seq = new int[length];\n int first = 0;\n int last = 0;\n _seq[first] = seq[0];\n\n for (int i = 1; i < length; i++) {\n if (seq[i] < _seq[first]) {\n first = (first - 1 + length) % length; \/\/ \u63d2\u5165\u5230first\u4e4b\u524d\n _seq[first] = seq[i];\n } else if (seq[i] >= _seq[last]) {\n last++; \/\/ \u63d2\u5165\u5230last\u4e4b\u540e\n _seq[last] = seq[i];\n } else {\n\n \/\/ 1.\u91c7\u7528\u76f4\u63a5\u63d2\u5165\n \/\/ int j;\n \/\/ for(j = last; seq[i] < _seq[j]; j = (j - 1 + length) %\n \/\/ length)\n \/\/ _seq[(j + 1 + length) % length] = _seq[j]; \/\/\u540e\u8005\u8986\u76d6\u524d\u8005\n \/\/ _seq[(j + 1 + length) % length] = seq[i];\n \/\/ last++;\n\n \/\/ 2.\u91c7\u7528\u4e8c\u5206\u67e5\u627e\u4f4d\u7f6e\u540e\u63d2\u5165\n int low = first;\n int high = last;\n int mid = 0;\n int d = 0; \/\/ \u9ad8\u4f4e\u4e24\u7aef\u4e4b\u95f4\u7684\u5143\u7d20\u4e2a\u6570\n while (low != high) {\n d = (high - low + length) \/ length;\n mid = (low + d \/ 2) % length;\n if (seq[i] >= _seq[mid]) {\n low = (mid + 1 + length) % length;\n } else {\n high = mid;\n }\n }\n\n \/\/ \u5411\u524d\u5bfb\u627e\u63d2\u5165\u70b9\n int j = last + 1;\n int k;\n while (j != low) {\n k = (j - 1 + length) % length;\n _seq[j] = _seq[k];\n j = k;\n }\n _seq[low] = seq[i];\n last++;\n }\n }\n\n \/\/ \u6574\u7406\u5230\u539f\u5e8f\u5217\n for (int i = 0; i < length; i++) {\n seq[i] = _seq[(first + i) % length];\n }\n}<\/pre>\n\n\n\n\u5e0c\u5c14\u6392\u5e8f<\/h3>\n\n\n\n
\u8be5\u7b97\u6cd5\u53c8\u79f0\u7f29\u5c0f\u589e\u91cf\u6392\u5e8f\uff0c\u662f\u63d2\u5165\u7b97\u6cd5\u7684\u4e00\u79cd\u53e0\u52a0\u4e0e\u6539\u8fdb\u3002\u6734\u7d20\u7684\u63d2\u5165\u6392\u5e8f\u4e2d\u7684\u6709\u5e8f\u5b50\u5e8f\u5217\u90fd\u662f\u4ee51\u4e3a\u589e\u91cf\u7684\uff0c\u4e2d\u95f4\u4e0d\u80fd\u8dc3\u8fc7\u4efb\u4e00\u5143\u7d20\uff0c\u800c\u5e0c\u5c14\u6392\u5e8f\u5219\u53ef\u4ee5\uff0c\u5b83\u7b2c\u4e00\u8f6e\u5148\u8bbe\u5b9a\u4e00\u4e2a\u589e\u91cfgap\uff0c\u7136\u540e\u9501\u5b9a\u4e00\u4e2a\u8d77\u59cb\u4f4d\u7f6estart\uff0c\u8ba9start + i, start + i + gap, start + i + 2*gap, start + i + 3*gap,…(0<=i<gap)\u6784\u6210\u5e8f\u5217i\uff0c\u6700\u7ec8\u5f97\u5230gap\u4e2a\u5e8f\u5217\uff0c\u7136\u540e\u5206\u522b\u5bf9\u5176\u4f7f\u7528\u63d2\u5165\u6392\u5e8f\u3002\u7b2c\u4e8c\u8f6e\u8ba9gap=gap\/2\uff08\u6bcf\u6b21\u96642\uff09\uff0c\u540e\u9762\u539f\u7406\u540c\u4e0a\u3002\u5982\u6b64\u5f80\u590d\uff0c\u76f4\u5230\u6700\u540egap=1\uff0c\u5219\u6f14\u53d8\u4e3a\u4e00\u822c\u7684\u63d2\u5165\u6392\u5e8f\uff0c\u800c\u6b64\u65f6\u4e0d\u5fc5\u62c5\u5fc3\uff0c\u56e0\u4e3a\u5e8f\u5217\u5df2\u7ecf\u57fa\u672c\u6709\u5e8f\u4e86\uff0c\u6240\u4ee5\u57fa\u672c\u4e0d\u9700\u8981\u6392\u591a\u5c11\u6b21\u3002\u6240\u4ee5\u8bfb\u5230\u8fd9\u91cc\uff0c\u5927\u6982\u5c31\u80fd\u77e5\u9053\u4e3a\u4ec0\u4e48\u9009\u7528\u63d2\u5165\u6392\u5e8f\u6765\u6539\u8fdb\uff0c\u800c\u4e0d\u9009\u5192\u6ce1\u548c\u9009\u62e9\u4e86\u5427\uff0c\u5c31\u662f\u56e0\u4e3a\u63d2\u5165\u6392\u5e8f\u5728\u5e8f\u5217\u57fa\u672c\u6709\u5e8f\u65f6\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u662fO(n)\u8fd9\u4e2a\u7279\u6027\uff0c\u4f7f\u5f97\u5b83\u6bd4\u5176\u4ed6\u4e24\u79cd\u7b97\u6cd5\u66f4\u5177\u4f18\u52bf\uff01<\/p>\n\n\n\n
void shellSort(int[] seq) {\n \/\/ \u96642\u589e\u91cf\u7684\u5e0c\u5c14\u6392\u5e8f\n for (int gap = seq.length \/ 2; gap > 0; gap \/= 2) {\n for (int start = 0; start < gap; start++) {\n insertSortWithGap(seq, start, gap);\n }\n }\n}\n\n\/\/ \u63d2\u5165\u6392\u5e8f\u7b97\u6cd5(\u670d\u52a1\u5e0c\u5c14\u6392\u5e8f)\n\/\/ start: \u8d77\u59cb\u5904\uff08\u9ed8\u8ba4\u4e3a0\uff09\n\/\/ gap: \u589e\u91cf\uff08\u9ed8\u8ba4\u4e3a1\uff09\nvoid insertSortWithGap(int[] seq, int start, int gap) {\n for (int i = start + gap; i < seq.length; i += gap) {\n int target = seq[i]; \/\/ \u6682\u5b58\u4f4f\n \/\/ \u5411\u524d\u5bfb\u627e\u63d2\u5165\u70b9\n int j = i - gap;\n while (j >= 0 && target < seq[j]) {\n seq[j + gap] = seq[j];\n j -= gap;\n }\n seq[j + gap] = target;\n }\n}<\/pre>\n\n\n\n\u7ed3\u8bed<\/h3>\n\n\n\n
\u7b80\u5355\u6392\u5e8f\u7b97\u6cd5\u672c\u6587\u5c31\u53ea\u8bb0\u5f55\u4e86\u8fd9\u4e9b\uff0c\u4e0b\u4e00\u7ae0\u4f1a\u8bb0\u5f55\u4e00\u4e9b\u66f4\u6709\u6548\u7387\u3001\u66f4\u6709\u601d\u60f3\u7684\u590d\u6742\u6392\u5e8f\u7b97\u6cd5\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u5f15\u8a00 \u6392\u5e8f\u662f\u8ba1\u7b97\u673a\u5185\u7ecf\u5e38\u8fdb\u884c\u7684\u4e00\u79cd\u64cd\u4f5c\uff0c\u5176\u76ee\u7684\u662f\u5c06\u4e00\u7ec4\u201c\u65e0\u5e8f\u201d\u7684\u8bb0\u5f55\u5e8f\u5217\u8c03\u6574\u4e3a\u201c\u6709\u5e8f\u201d\u7684\u8bb0\u5f55\u5e8f\u5217\uff0c\u5b83\u5728\u5927\u5927\u5c0f\u5c0f […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[55,46],"tags":[],"_links":{"self":[{"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/posts\/543"}],"collection":[{"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/comments?post=543"}],"version-history":[{"count":26,"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/posts\/543\/revisions"}],"predecessor-version":[{"id":2329,"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/posts\/543\/revisions\/2329"}],"wp:attachment":[{"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/media?parent=543"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/categories?post=543"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/yaochenkun.site\/index.php\/wp-json\/wp\/v2\/tags?post=543"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}