{"id":892,"date":"2019-12-16T11:12:29","date_gmt":"2019-12-16T03:12:29","guid":{"rendered":"http:\/\/47.101.202.111\/?p=892"},"modified":"2022-12-17T13:34:44","modified_gmt":"2022-12-17T05:34:44","slug":"algorithm-sort","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=892","title":{"rendered":"\u56de\u5f52\u6b63\u786e\u4f4d\u7f6e – \u5341\u5927\u6392\u5e8f"},"content":{"rendered":"

\u6392\u5e8f<\/h2>\n

\u6392\u5e8f\u901a\u8fc7 \u6bd4\u8f83<\/strong> \u548c \u4ea4\u6362<\/strong> \u5c06\u5143\u7d20\u56de\u5f52\u6b63\u786e\u4f4d\u7f6e
\n\u4e0d\u540c\u7684\u6392\u5e8f\u601d\u60f3\u6709\u5404\u81ea\u7684\u7279\u70b9\u548c\u66f4\u9002\u5b9c\u7684\u573a\u666f
\n\u53ef\u5229\u7528\u6392\u5e8f\u540e\u7684\u5e8f\u5217\u65b9\u4fbf\u65b9\u4fbf\u8fdb\u4e00\u6b65\u89e3\u51b3\u95ee\u9898<\/p>\n

\u9009\u62e9\u6392\u5e8f<\/h2>\n

\u601d\u60f3<\/strong> \u6bcf\u8f6e\u9009\u51fa\u6700\u5c0f\u503c\uff0c\u6309\u5347\u5e8f\u7f6e\u4e8e\u6570\u7ec4
\n\u4f18\u70b9<\/strong> \u6570\u636e\u79fb\u52a8\u6700\u5c11
\n\u7f3a\u70b9<\/strong> \u65e0\u8111\uff0c\u6709\u5e8f\u6570\u7ec4\u4ecd\u9700\u8d70\u5b8c\u6240\u6709\u6d41\u7a0b
\n\u6027\u80fd<\/strong> O(n^2 \/ 2)<\/p>\n

    public void sort(int[] a) {\n        int N = a.length;\n        for (int i = 0; i < N; i++) {\n            int m = i;\n            for (int j = i + 1; j < N; j++)\n                if (a[j] < a[i]) m = j;\n            swap(a, i, m);\n        }\n    }\n<\/code><\/pre>\n
\u63d2\u5165\u6392\u5e8f<\/h2>\n
\u601d\u60f3<\/strong> \u4e0e\u5df2\u6392\u5143\u7d20\u6bd4\u8f83\u4ea4\u6362\uff0c\u76f4\u5230\u6362\u5230\u6b63\u786e\u4f4d\u7f6e
\n\u4f18\u70b9<\/strong> \u6027\u80fd\u4f18\u4e8e\u9009\u62e9\u6392\u5e8f\u3002\u5229\u7528\u4e86\u6709\u5e8f\u4fe1\u606f\uff0c\u5bf9\u5f88\u591a\u5143\u7d20\u5df2\u7ecf\u6709\u5e8f\u7684\u60c5\u51b5\uff0c\u4ec5\u9700\u5f88\u5c11\u7684\u4ea4\u6362\u6b21\u6570\uff0c\u53ef\u8fbe\u7ebf\u6027\u590d\u6742\u5ea6
\n\u7f3a\u70b9<\/strong> \u5b8c\u5168\u9006\u5e8f\u5e8f\u5217\u8981\u8fdb\u884c n^2 \/ 2 \u6b21\u6bd4\u8f83\u548c\u4ea4\u6362\uff0c\u6027\u80fd\u5f31\u4e8e\u9009\u62e9\u6392\u5e8f
\n\u6027\u80fd<\/strong> \u5e73\u5747 O(n^2 \/ 4)\uff0c\u53d6\u51b3\u4e8e\u9006\u5e8f\u5bf9\u4e2a\u6570<\/p>\n
    public void sort(int[] a) {\n        int N = a.length;\n        for (int i = 1; i < N; i++) {\n            for (int j = i; j > 0; j--) {\n                if (a[j] < a[j - 1])\n                    swap(a, j, j - 1);\n                else break;\n            }\n        }\n    }\n<\/code><\/pre>\n
\u5e0c\u5c14\u6392\u5e8f<\/h2>\n
\u601d\u60f3<\/strong> \u62c6\u4e3a\u591a\u4e2a\u5b50\u5e8f\u5217\u7684\u63d2\u5165\u6392\u5e8f\uff0c\u5b50\u5e8f\u5217\u5185\u90e8\u95f4\u9694\u76f8\u7b49\u3002\u8f83\u5927\u95f4\u9694\u7684\u63d2\u5165\u6392\u5e8f\u5b50\u5e8f\u5217\u8f83\u77ed\uff0c\u8fd0\u884c\u65f6\u95f4\u5c11\uff0c\u53ef\u5c06\u8f83\u8fdc\u5143\u7d20\u4ea4\u6362\u81f3\u524d\u5f62\u6210\u90e8\u5206\u6709\u5e8f\u5e8f\u5217\uff0c\u51cf\u5c11\u4e86\u4e0b\u4e00\u8f6e\u63d2\u5165\u6392\u5e8f\u7684\u6bd4\u8f83\u548c\u4ea4\u6362\u6b21\u6570\u3002\u8f83\u5c0f\u95f4\u9694\u7684\u63d2\u5165\u6392\u5e8f\u5b50\u5e8f\u5217\u8f83\u957f\uff0c\u5f88\u597d\u5730\u5229\u7528\u4e86\u4e0a\u8f6e\u5f62\u6210\u7684\u90e8\u5206\u6709\u5e8f\u5e8f\u5217\u6027\u8d28\u3002\u968f\u7740\u95f4\u9694\u9012\u51cf\uff0c\u6bcf\u4e00\u8f6e\u6392\u5e8f\u590d\u6742\u5ea6\u9010\u6b65\u63a5\u8fd1\u7ebf\u6027\uff0c\u63d0\u5347\u4e86\u7b97\u6cd5\u901f\u5ea6
\n\u4f18\u70b9<\/strong> \u901f\u5ea6\u8f83\u5feb\uff0c\u5360\u7528\u5185\u5b58\u5c11\uff0c\u4ee3\u7801\u91cf\u5c11
\n\u6027\u80fd<\/strong> \u6700\u574f\u590d\u6742\u5ea6\u4e3a O(n^(3\/2))<\/p>\n
public void sort(int[] a) {\n    int N = a.length;\n    int k = 1;\n    while (k < N \/ 3) k = 3 * k + 1;\n    for (; k >= 1; k \/= 3) {\n        for (int i = k; i < N; i++) {\n            for (int j = i; j >= k; j -= k)\n                if (a[j] < a[j - k]) swap(a, j, j - k);\n        }\n    }\n}\n<\/code><\/pre>\n
\u5f52\u5e76\u6392\u5e8f<\/h2>\n
Merge Sort \u2013 \u5f52\u5e76\u6392\u5e8f\u8be6\u89e3\u4e0e\u4f18\u5316<\/a><\/p>\n
\u5feb\u901f\u6392\u5e8f<\/h2>\n
\u601d\u60f3<\/strong> \u9009\u53d6\u67a2\u8f74\uff0c\u4f7f\u67a2\u8f74\u5de6\u4fa7\u4e0d\u5927\u4e8e\u67a2\u8f74\uff0c\u67a2\u8f74\u53f3\u4fa7\u4e0d\u5c0f\u4e8e\u67a2\u8f74\u3002\u5206\u522b\u5bf9\u67a2\u8f74\u5de6\u53f3\u4fa7\u5b50\u5e8f\u5217\u53ca\u5b50\u5e8f\u5217\u7684\u5b50\u5e8f\u5217\u9012\u5f52\u8fdb\u884c\u4e0a\u8ff0\u64cd\u4f5c\u4f7f\u6bcf\u4e2a\u67a2\u8f74\u5de6\u53f3\u4fa7\u5747\u6709\u5927\u5c0f\u5173\u7cfb\uff0c\u9012\u5f52\u5b8c\u6bd5\u5219\u5e8f\u5217\u6709\u5e8f\u3002
\n\u4f18\u70b9<\/strong> \u901f\u5ea6\u5feb\uff0c\u6bd4\u8f83\u6b21\u6570\u5c11\uff0c\u65e0\u9700\u989d\u5916\u5185\u5b58\uff0c\u4ee3\u7801\u7b80\u6d01
\n\u7f3a\u70b9<\/strong> \u53d7\u9650\u4e8e\u67a2\u8f74\u7684\u9009\u53d6\uff0c\u6700\u574f\u60c5\u51b5\u4f1a\u964d\u4e3a O(n^2 \/ 2)\uff0c\u4e3a\u4fdd\u8bc1\u6027\u80fd\u4e00\u822c\u5728\u6392\u5e8f\u524d\u968f\u673a\u6253\u4e71\u987a\u5e8f<\/strong>
\n\u6027\u80fd<\/strong> \u590d\u6742\u5ea6\u4e3a O(nlogn\uff09
\n\u5b9e\u73b0<\/strong> \u67a2\u8f74\u9009\u53d6\uff1a\u53d6\u7b2c\u4e00\u4e2a\u5143\u7d20\u4e3a\u67a2\u8f74\uff1b\u67a2\u8f74\u5f52\u4f4d\uff1a\u6307\u9488\u76f8\u9047\u540e\u7531\u4e8e–j\uff0c\u603b\u4f7fj\u6307\u5411\u6700\u540e\u4e00\u4e2a\u5c0f\u4e8e\u67a2\u8f74\u5143\u7d20\uff0c\u5373\u67a2\u8f74\u5f52\u4f4d\u4f4d\u7f6e\uff1b\u91cd\u590d\u5143\u7d20\u5904\u7406\uff1a\u6307\u5411\u4e0e\u67a2\u8f74\u76f8\u540c\u7684\u5143\u7d20\u89c6\u4e3a\u627e\u5230\u5927\u4e8e\/\u5c0f\u4e8e\u67a2\u8f74\u6570\uff0c\u5bf9\u4e8e\u542b\u6709\u5927\u91cf\u91cd\u590d\u5143\u7d20\u7684\u5e8f\u5217\u4ecd\u9700\u505a\u51fa\u4e0d\u5fc5\u8981\u7684\u4ea4\u6362\uff1b\u6307\u9488\u5173\u7cfb\uff1a\u626b\u63cf\u5faa\u73af\u4f7fi\u6307\u9488\u5de6\u4fa7\u603b\u5c0f\u4e8e\u7b49\u4e8e\u67a2\u8f74\uff0cj\u6307\u9488\u53f3\u4fa7\u603b\u5927\u4e8e\u7b49\u4e8e\u67a2\u8f74\uff0c\u6697\u542bi<j\u5173\u7cfb\uff0c\u4ec5\u5728\u6307\u9488\u76f8\u9047\u540e\u4f7f\u5f97i<j\uff1b\u6700\u574f\u60c5\u51b5\uff1a\u5f85\u6392\u5e8f\u5217\u4e3a\u6b63\/\u9006\u5e8f\u5e8f\u5217\u9000\u5316\u4e3a\u9009\u62e9\u6392\u5e8f\uff0c\u6307\u9488\u5230\u8fbe\u8fb9\u754c\u4e0e\u67a2\u8f74\u6216\u672b\u5c3e\u5143\u7d20\u4ea4\u6362<\/p>\n
    public void sort(int[] a, int lo, int hi) {\n        if(lo >= hi) return;\n        int j = partition(a, lo, hi);\n        sort(a, lo, j - 1);\n        sort(a, j + 1, hi);\n    }\n\n    public int partition(int[] a, int lo, int hi) {\n        int i = lo;\n        int j = hi + 1;\n        while(true) {\n            while(a[++i] < a[lo]) if(i == hi) break; \/\/ \u4ece\u5934\u5411\u53f3\u5bfb\u627e\u5927\u4e8e\u67a2\u8f74\u6570\n            while(a[--j] > a[lo]) if(j == lo) break; \/\/ \u4ece\u5c3e\u81f3\u5934\u5bfb\u627e\u5c0f\u4e8e\u67a2\u8f74\u6570\n            if(i >= j) break;                        \/\/ \u6307\u9488\u4ea4\u9519\u672c\u8f6e\u5df2\u6392\u597d\u8df3\u51fa\n            swap(a, i, j);                           \/\/ \u6307\u9488\u672a\u4ea4\u9519\u4ea4\u6362\u5927\u5c0f\u5173\u7cfb\n        }\n        swap(a, lo, j);                              \/\/ \u5c06\u67a2\u8f74\u7f6e\u4e8e\u4e2d\u95f4\n        return j;                                    \/\/ \u8fd4\u56de\u67a2\u8f74\u4e0b\u6807\n    }\n<\/code><\/pre>\n
\u4e09\u5411\u5207\u5206<\/h3>\n
\u7ef4\u62a4\u4e24\u4e2a\u6307\u9488l\u548cr\uff0c\u4f7fl\u5de6\u4fa7\u6570\u5747\u5c0f\u4e8e\u67a2\u8f74\uff0cr\u53f3\u4fa7\u6570\u5747\u5927\u4e8e\u67a2\u8f74\uff0c\u4e2d\u95f4\u6240\u5939\u5747\u7b49\u4e8e\u67a2\u8f74\uff0c\u9010\u6b65\u7f29\u5c0f\u6700\u5de6\u6700\u53f3\u8303\u56f4\uff0c\u5b8c\u6bd5\u8fdb\u5165\u5b50\u5e8f\u5217\u9012\u5f52\u65f6\u53ea\u9700\u53d6\u4e24\u4e2a\u6307\u9488\u4e3a\u8fb9\u754c\uff0c\u65e0\u9700\u5c06\u4e2d\u95f4\u503c\u8ba1\u5165\uff0c\u56e0\u800c\u7f29\u5c0f\u4e86\u89c4\u6a21\u3002\u5f53\u5e8f\u5217\u4e2d\u6709\u8f83\u591a\u91cd\u590d\u5143\u7d20\u65f6\u5f88\u9ad8\u6548\uff0c\u53ef\u8fbe\u7ebf\u6027\u590d\u6742\u5ea6\uff0c\u6700\u574f\u60c5\u51b5\u6240\u6709\u503c\u5747\u76f8\u5f02\uff0c\u590d\u6742\u5ea6\u4e3aO(nlogn\uff09<\/p>\n
    public void sort(int[] a, int lo, int hi) {\n        if(lo >= hi) return;\n        int l = lo;                                 \/\/ l\u6307\u5411\u7b49\u4e8e\u67a2\u8f74\u6570\n        int i = lo + 1;                             \/\/ i\u6307\u5411\u5f53\u524d\u8bbf\u95ee\u6570\n        int r = hi;\n        int v = a[lo];\n        while(i <= r) {\n            if     (a[i] < v)   swap(a, i++, l++);  \/\/ \u5c0f\u4e8e\u67a2\u8f74\u6570\u4ea4\u6362\u5230\u6700\u5de6\u4fa7\u3002i\u4e3a\u67a2\u8f74\u65e0\u9700\u4e0e\u67a2\u8f74\u6bd4\u8f83\uff0c\u76f4\u63a5\u8fdb\u5165\u4e0b\u8f6e\n            else if(a[i] > v)   swap(a, i, r--);    \/\/ \u5927\u4e8e\u67a2\u8f74\u6570\u4ea4\u6362\u5230\u6700\u53f3\u4fa7\u3002\u4ea4\u6362\u5230i\u4f4d\u7f6e\u6570\u5728\u4e0b\u8f6e\u4e0e\u67a2\u8f74\u6bd4\u8f83\n            else                i++;                \/\/ \u7b49\u4e8e\u539f\u5730\u4e0d\u52a8\uff0c\u6307\u5411\u4e0b\u4e00\u4e2a\u6570\u518d\u6b21\u5224\u65ad\n        }\n        sort(a, lo, l - 1);                         \/\/ \u9012\u5f52\u5de6\u4fa7\u5b50\u5e8f\u5217\n        sort(a, r + 1, hi);                         \/\/ \u9012\u5f52\u53f3\u4fa7\u5b50\u5e8f\u5217\n    }\n<\/code><\/pre>\n
\u5feb\u901f\u9009\u62e9<\/h3>\n
\u7528\u4e8e\u627e\u5230\u7b2cK\u4e2a\uff08\u4ece0\u5f00\u59cb\u8ba1\u6570\uff09\u6700\u5927\/\u5c0f\u503c\u3002\u4ee5\u627e\u5230\u7b2cK\u4e2a\u6700\u5c0f\u503c\u4e3a\u4f8b\uff0c\u5373\u627e\u5230\u6392\u5e8f\u540e\u4e0b\u6807K\u5bf9\u5e94\u503c\u3002\u5feb\u901f\u6392\u5e8f\u601d\u60f3\u4e2d\uff0c\u67a2\u8f74\u5de6\u53f3\u4fa7\u5927\u5c0f\u5173\u7cfb\u5df2\u5b9a\uff0c\u4ec5\u9700\u5bf9\u67a2\u8f74\u4e00\u4fa7\u6570\u7ec4\u8fdb\u884c\u6392\u5e8f\u5373\u53ef\u786e\u5b9a\u5230\u4f4d\u7f6eK\uff0c\u7701\u53bb\u4e00\u534a\u64cd\u4f5c\u3002\u4f9d\u6b21\u5411\u5185\u4e00\u76f4\u6298\u534a\u9012\u5f52\uff0c\u76f4\u5230\u9012\u5f52\u81f3\u4ec5\u6709\u4e00\u4e2a\u5143\u7d20\u5373a[K]\u65f6\u5b8c\u6210\u5c40\u90e8\u6392\u5e8f\u7ed3\u675f\u3002\u590d\u6742\u5ea6\u4e3aO(n)\uff0c\u5e8f\u5217\u4e3a\u6b63\/\u9006\u5e8f\u4e3a\u6700\u574f\u60c5\u51b5\uff0c\u590d\u6742\u5ea6\u4e3aO(n^2 \/ 2)<\/p>\n
    public int quickSelect(int[] a, int K) {\n        int lo = 0;\n        int hi = a.length - 1;\n        while(lo < hi) {\n            int i = partition(a, lo, hi);\n            if      (i > K) lo = i + 1;\n            else if (i < K) hi = i - 1;\n            else            return a[K];\n        }\n        return a[K];\n    }\n<\/code><\/pre>\n
\u5806\u6392\u5e8f<\/h2>\n
\u7c7b\u4f3c\u4e8e\u9009\u62e9\u6392\u5e8f\uff0c\u5806\u6392\u5e8f\u6bcf\u6b21\u53d6\u5806\u9876\u5143\u7d20\uff08\u6700\u5927\u5143\u7d20\uff09\u5012\u5e8f\u7f6e\u4e8e\u6570\u7ec4\u800c\u6210\u5347\u5e8f
\n\u4e0d\u540c\u4e8e\u9009\u62e9\u6392\u5e8f\u9700\u8981\u7ebf\u6027\u904d\u5386\u67e5\u627e\u6700\u5927\u5143\u7d20\uff0c\u6700\u5927\u5806\u5177\u6709\u5806\u9876\u5143\u7d20\u6700\u5927\u7684\u6027\u8d28<\/p>\n
\u6700\u5927\u4e8c\u53c9\u5806<\/h3>\n
\u6240\u6709\u7236\u8282\u70b9\u5747\u5927\u4e8e\u5b50\u8282\u70b9\u7684\u5b8c\u5168\u4e8c\u53c9\u6811<\/p>\n
\n    public class MaxHeap {\n        private int[] a;        \/\/ \u5806\u53ca\u5176\u4e2d\u5143\u7d20\uff0c\u957f\u5ea6\u4e3a N+1\n        private int N;          \/\/ \u5143\u7d20\u4e2a\u6570\uff0c\u4e5f\u5373\u5806\u672b\u4e0b\u6807\n    }\n<\/pre>\n
\u7236\u5b50\u8282\u70b9\u5173\u7cfb<\/strong> \u7d22\u5f15\u4ece1\u5f00\u59cb\u8ba1\u3002\u5df2\u77e5\u7236\u8282\u70b9\u7d22\u5f15 i<\/strong>\uff0c\u5219\u5b50\u8282\u70b9\u7d22\u5f15\u4e3a 2i<\/strong> \u548c 2i+1<\/strong>\u3002\u5df2\u77e5\u5b50\u8282\u70b9\u7d22\u5f15 i<\/strong>\uff0c\u7236\u8282\u70b9\u7d22\u5f15\u4e3a i\/2<\/strong>
\n\u8c03\u6574\u6700\u5927\u5806\u5e8f\u7ed3\u6784<\/strong> \u8c03\u6574\u5806\u6709\u5e8f\u5c31\u662f\u7ef4\u6301\u6240\u6709\u7236\u8282\u70b9\u5747\u5927\u4e8e\u5b50\u8282\u70b9\u7684\u5173\u7cfb\u3002\u5f53\u7531\u4e8e\u6539\u53d8\u5b50\u8282\u70b9\u4f7f\u5b50\u8282\u70b9>\u7236\u8282\u70b9\u65f6\uff0c\u5c06\u5b50\u8282\u70b9\u4e0e\u7236\u8282\u70b9\u4e0d\u65ad\u4e92\u6362\u4e0a\u79fb<\/strong>\uff0c\u6539\u53d8\u7236\u8282\u70b9\u7834\u574f\u5806\u6709\u5e8f\u65f6\uff0c\u5c06\u8f83\u5c0f\u7684\u7236\u8282\u70b9\u4e0e\u6700\u5927\u5b50\u8282\u70b9\u4e92\u6362\u4e0d\u65ad\u4e0b\u79fb<\/strong>\uff0c\u76f4\u81f3\u6ee1\u8db3\u5806\u6709\u5e8f<\/p>\n
    public void up(int i) {\n        while (i > 1) {\n            int p = i \/ 2;\n            if (a[p] < a[i]) swap(a, i, p);\n            else break;\n            i = p;\n        }\n    }\n\n    public void dn(int i) {\n        while (i * 2 <= N) { \/\/ \u6709\u5de6\u5b50\u8282\u70b9\u6d4b\u8bd5\u4e0b\u79fb\n            int lf = 2 * i;\n            int rf = lf + 1;\n            if (rf <= N && a[lf] < a[rf]) lf = rf;\n            if (a[i] < a[lf]) swap(a, i, lf);\n            else break;\n            i = lf;\n        }\n    }\n<\/code><\/pre>\n
\u6700\u5927\u5806\u6784\u9020<\/strong> \u76f4\u63a5\u8f93\u5165\u4ece1\u5f00\u59cb\u8ba1\u7684\u65e0\u5e8f\u6570\u7ec4\uff0c\u4ece\u5012\u6570\u7b2c\u4e8c\u5c42\u5f00\u59cb\u4e0d\u65ad\u5c06\u5c0f\u7684\u7236\u8282\u70b9\u4e0b\u79fb<\/strong>\uff0c\u81ea\u53f3\u5411\u5de6\uff0c\u81ea\u5e95\u5411\u4e0a\u76f4\u5230\u6839\u8282\u70b9\u8c03\u6574\u5806\u5e8f\u3002\u4e5f\u53ef\u4ece\u96f6\u5f00\u59cb\u5c06\u8282\u70b9\u4e00\u4e2a\u4e00\u4e2a\u63d2\u5165\u5806\u672b\u5e76\u4e0d\u65ad\u5c06\u8f83\u5927\u7684\u5b50\u8282\u70b9\u4e0a\u79fb<\/strong>\uff0c\u76f8\u5bf9\u4e8e\u7b2c\u4e00\u79cd\u65b9\u6cd5\u591a\u51fa\u4e86\u6700\u540e\u4e00\u5c42\u8282\u70b9\u7684\u64cd\u4f5c<\/p>\n
    public MaxHeap(int[] a) {\n        this.a = a;\n        this.N = a.length - 1;\n        int i = N \/ 2;\n        while (i >= 1) dn(i--);\n    }\n<\/code><\/pre>\n
\u6700\u5927\u4e8c\u53c9\u5806\u6392\u5e8f<\/h3>\n
\u6784\u9020\u6700\u5927\u5806\u540e\uff0c\u6bcf\u6b21\u5c06\u6700\u5927\u5143\u7d20\u51fa\u5806\u7f6e\u4e8e\u6570\u7ec4\u672b\u5c3e\uff0c\u539f\u672b\u5c3e\u5143\u7d20\u7f6e\u4e8e\u6839\u8282\u70b9\uff0c\u6062\u590d\u5806\u5e8f<\/p>\n
    public void sort() {\n        while (N >= 1) {\n            swap(a, 1, N--);\n            dn(1);\n        }\n    }\n<\/code><\/pre>\n
\u7d22\u5f15\u4e8c\u53c9\u5806<\/h3>\n
\u80cc\u666f<\/strong> \u5f53\u5f85\u6392\u5143\u7d20\u662f\u8f83\u590d\u6742\u7684\u6570\u636e\u7ed3\u6784\u65f6\uff0c\u5728\u5806\u4e2d\u7684\u4ea4\u6362\u64cd\u4f5c\u6210\u672c\u8f83\u9ad8
\n\u5143\u7d20\u63d2\u5165\u5806\u540e\uff0c\u82e5\u67d0\u4e2a\u5143\u7d20\u7684\u503c\u53d1\u751f\u66f4\u65b0\u9700\u8981\u4fee\u6539\uff0c\u9700\u8981\u904d\u5386\u5806\u6765\u5bfb\u627e\u8be5\u5143\u7d20
\n\u601d\u60f3<\/strong> \u4e3a\u6bcf\u4e2a\u5143\u7d20\u8bbe\u7f6e\u4e00\u4e2a\u7d22\u5f15\uff0c\u9700\u8981\u66f4\u65b0\u7279\u5b9a\u5143\u7d20\u65f6\u76f4\u63a5\u901a\u8fc7\u7d22\u5f15\u8bbf\u95ee
\n\u6784\u9020\u5806\u65f6\u5143\u7d20\u4e0d\u5165\u5806\uff0c\u7d22\u5f15\u5165\u5806\uff0c\u6784\u5efa\u7d22\u5f15\u4e8c\u53c9\u5806<\/p>\n
\u601d\u8def\n    \u6bcf\u4e2a\u5143\u7d20\u5165\u5806\u65f6\u7ed1\u5b9a\u4e00\u4e2a\u7d22\u5f15\n -> \u901a\u8fc7\u7d22\u5f15\u627e\u5165\u5806\u540e\u5bf9\u5e94\u5143\u7d20\n -> \u7d22\u5f15\u5728\u5165\u5806\u540e\u88ab\u91cd\u6392\uff0c\u65e0\u6cd5\u76f4\u63a5\u627e\u5230\u8be5\u7d22\u5f15\u6240\u5728\u4f4d\u7f6e\n -> \u8bbe\u7f6e\u4e00\u4e2a\u6570\u7ec4\u4fdd\u5b58\u7d22\u5f15\u5f53\u524d\u6240\u5728\u4f4d\u7f6e\n -> \u7d22\u5f15\u5728\u5165\u5806\u548c\u5806\u4e2d\u4ea4\u6362\u65f6\uff0c\u540c\u65f6\u8981\u66f4\u65b0\u7d22\u5f15\u6240\u5728\u4f4d\u7f6e\n<\/code><\/pre>\n
\u5b9e\u73b0<\/strong><\/p>\n
    public class IndexPriorityQueue{\n        String[] key;   \/\/ \u5143\u7d20\u4e0d\u5165\u5806\uff0c\u4f4d\u7f6e\u56fa\u5b9a\uff0c\u4ec5\u5728\u6bd4\u8f83\u65f6\u901a\u8fc7\u7d22\u5f15\u8bbf\u95ee\n        int[] lo;       \/\/ \u4e0b\u6807\u4e0e\u5143\u7d20\u4e00\u4e00\u5bf9\u5e94\uff0c\u4fdd\u5b58\u8be5\u5143\u7d20\u7d22\u5f15\u6240\u5728\u4f4d\u7f6e\n        int[] id;       \/\/ \u4fdd\u5b58\u7d22\u5f15\uff0c\u6784\u6210\u7d22\u5f15\u4e8c\u53c9\u5806\n    }\n\n<\/code><\/pre>\n
\u4e09\u53c9\u5806<\/h3>\n
\u5192\u6ce1\u6392\u5e8f\uff08\u5f85\u7eed\uff09<\/h2>\n
\u9010\u4f4d\u6bd4\u8f83\uff0c\u5927\u5219\u4ea4\u6362<\/p>\n
    public void BubbleSort(int[] nums) {\n        for(int i = 0; i < nums.length; i++) {\n        }\n    }\n<\/code><\/pre>\n
\u6876\u6392\u5e8f\uff08\u5f85\u7eed\uff09<\/h2>\n
\u57fa\u4e8e\u6bd4\u8f83\u7684\u6392\u5e8f\u7b97\u6cd5\u4e0b\u754c\u662fO(nlogn)
\n\u5f52\u5e76\u6392\u5e8f\u7684\u4f18\u5316<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6392\u5e8f \u6392\u5e8f\u901a\u8fc7 \u6bd4\u8f83 \u548c \u4ea4\u6362 \u5c06\u5143\u7d20\u56de\u5f52\u6b63\u786e\u4f4d\u7f6e \u4e0d\u540c\u7684\u6392\u5e8f\u601d\u60f3\u6709\u5404\u81ea\u7684\u7279\u70b9\u548c\u66f4\u9002\u5b9c\u7684\u573a\u666f \u53ef\u5229\u7528\u6392\u5e8f\u540e\u7684\u5e8f … <\/p>\n
\u7ee7\u7eed\u9605\u8bfb\u201c\u56de\u5f52\u6b63\u786e\u4f4d\u7f6e – \u5341\u5927\u6392\u5e8f\u201d<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[12],"tags":[30],"jetpack_featured_media_url":"","_links":{"self":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/892"}],"collection":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=892"}],"version-history":[{"count":55,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/892\/revisions"}],"predecessor-version":[{"id":2560,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/892\/revisions\/2560"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=892"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=892"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=892"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}