{"id":1721,"date":"2026-06-02T20:10:06","date_gmt":"2026-06-02T12:10:06","guid":{"rendered":"http:\/\/wordpress.fangt.online\/?p=1721"},"modified":"2026-06-02T20:10:06","modified_gmt":"2026-06-02T12:10:06","slug":"%e5%bf%ab%e9%80%9f%e6%8e%92%e5%ba%8f%ef%bc%88quick-sort%ef%bc%89","status":"publish","type":"post","link":"http:\/\/wordpress.fangt.online\/index.php\/2026\/06\/02\/%e5%bf%ab%e9%80%9f%e6%8e%92%e5%ba%8f%ef%bc%88quick-sort%ef%bc%89\/","title":{"rendered":"\u5feb\u901f\u6392\u5e8f\uff08Quick Sort\uff09"},"content":{"rendered":"\n

\u5feb\u901f\u6392\u5e8f\u662f\u4e00\u79cd\u5206\u6cbb\u7b97\u6cd5<\/strong>\u3002\u5b83\u901a\u8fc7\u9009\u62e9\u4e00\u4e2a\u201c\u57fa\u51c6\u201d\u5143\u7d20\uff08pivot\uff09\uff0c\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u5b50\u6570\u7ec4\uff1a\u5de6\u8fb9\u6240\u6709\u5143\u7d20 \u2264 \u57fa\u51c6\uff0c\u53f3\u8fb9\u6240\u6709\u5143\u7d20 \u2265 \u57fa\u51c6\uff0c\u7136\u540e\u9012\u5f52\u5730\u5bf9\u4e24\u4e2a\u5b50\u6570\u7ec4\u8fdb\u884c\u5feb\u901f\u6392\u5e8f\u3002<\/p>\n\n\n\n

\u6838\u5fc3\u6b65\u9aa4<\/strong>\uff08\u5206\u6cbb\u4e09\u90e8\u66f2\uff09\uff1a<\/p>\n\n\n\n

    \n
  1. \u5206\u89e3\uff08Partition\uff09<\/strong>\uff1a\u9009\u53d6\u57fa\u51c6\uff0c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\uff0c\u4f7f\u5f97\u5de6\u534a \u2264 \u57fa\u51c6 \u2264 \u53f3\u534a\uff0c\u5e76\u8fd4\u56de\u57fa\u51c6\u7684\u6700\u7ec8\u4f4d\u7f6e\u3002<\/li>\n\n\n\n
  2. \u9012\u5f52\uff08Conquer\uff09<\/strong>\uff1a\u5bf9\u57fa\u51c6\u5de6\u8fb9\u548c\u53f3\u8fb9\u7684\u5b50\u6570\u7ec4\u9012\u5f52\u8fdb\u884c\u5feb\u901f\u6392\u5e8f\u3002<\/li>\n\n\n\n
  3. \u5408\u5e76\uff08Combine\uff09<\/strong>\uff1a\u7531\u4e8e\u662f\u539f\u5730\u6392\u5e8f\uff0c\u65e0\u9700\u5408\u5e76\u6b65\u9aa4\u3002<\/li>\n<\/ol>\n\n\n\n

    \u5173\u952e\u8bcd<\/strong>\uff1a\u4e0d\u7a33\u5b9a\u6392\u5e8f\u3001\u539f\u5730\u6392\u5e8f\u3001\u5206\u6cbb\u3001\u5e73\u5747 O(n log n)\u3001\u6700\u574f O(n\u00b2)<\/p>\n\n\n\n

    \u7b97\u6cd5\u6b65\u9aa4\uff08\u5347\u5e8f\u4e3a\u4f8b\uff09<\/h2>\n\n\n\n

    \u5047\u8bbe\u8981\u5bf9\u6570\u7ec4 arr[l..r]<\/code> \u8fdb\u884c\u6392\u5e8f\uff1a<\/p>\n\n\n\n

      \n
    • \u7ec8\u6b62\u6761\u4ef6<\/strong>\uff1al >= r<\/code>\uff0c\u5373\u5b50\u6570\u7ec4\u957f\u5ea6 \u2264 1\uff0c\u76f4\u63a5\u8fd4\u56de\u3002<\/li>\n\n\n\n
    • \u5212\u5206<\/strong>\uff1a\u8c03\u7528 partition(arr, l, r)<\/code>\uff0c\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u90e8\u5206\uff0c\u8fd4\u56de\u57fa\u51c6\u4e0b\u6807 pivotIndex<\/code>\u3002<\/li>\n\n\n\n
    • \u9012\u5f52\u5de6\u534a<\/strong>\uff1aquickSort(arr, l, pivotIndex - 1)<\/code><\/li>\n\n\n\n
    • \u9012\u5f52\u53f3\u534a<\/strong>\uff1aquickSort(arr, pivotIndex + 1, r)<\/code><\/li>\n<\/ul>\n\n\n\n

      \u5212\u5206\u65b9\u6cd5\uff08Partition\uff09<\/h2>\n\n\n\n

      \u6709\u591a\u79cd\u5212\u5206\u5b9e\u73b0\u65b9\u5f0f\uff0c\u6700\u7ecf\u5178\u7684\u662f Lomuto \u5212\u5206<\/strong> \u548c Hoare \u5212\u5206<\/strong>\u3002<\/p>\n\n\n\n

      Lomuto \u5212\u5206\uff08\u7b80\u5355\u6613\u61c2\uff09<\/h3>\n\n\n\n

      \u601d\u8def<\/strong>\uff1a\u9009\u62e9\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u4f5c\u4e3a\u57fa\u51c6\uff0c\u7528\u6307\u9488 i<\/code> \u6807\u8bb0\u5c0f\u4e8e\u57fa\u51c6\u7684\u533a\u57df\u8fb9\u754c\uff0c\u904d\u5386 j<\/code> \u4ece l<\/code> \u5230 r-1<\/code>\uff0c\u82e5 arr[j] \u2264 pivot<\/code>\uff0c\u5219\u4ea4\u6362 arr[i]<\/code> \u548c arr[j]<\/code>\uff0c\u5e76 i++<\/code>\u3002\u6700\u540e\u4ea4\u6362 arr[i]<\/code> \u548c arr[r]<\/code>\uff08\u5c06\u57fa\u51c6\u653e\u5230\u6b63\u786e\u4f4d\u7f6e\uff09\u3002<\/p>\n\n\n\n

      int partitionLomuto(int arr[], int l, int r) {\n    int pivot = arr[r];   \/\/ \u9009\u62e9\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u4e3a\u57fa\u51c6\n    int i = l;            \/\/ i \u6307\u5411\u5c0f\u4e8e\u57fa\u51c6\u533a\u57df\u7684\u4e0b\u4e00\u4e2a\u4f4d\u7f6e\n    for (int j = l; j < r; ++j) {\n        if (arr[j] <= pivot) {\n            swap(arr[i], arr[j]);\n            ++i;\n        }\n    }\n    swap(arr[i], arr[r]); \/\/ \u5c06\u57fa\u51c6\u653e\u5230\u6b63\u786e\u4f4d\u7f6e\n    return i;\n}<\/code><\/pre>\n\n\n\n
      \u7279\u70b9<\/strong>\uff1a\u5b9e\u73b0\u7b80\u5355\uff0c\u4f46\u4ea4\u6362\u6b21\u6570\u8f83\u591a\uff0c\u4e14\u5f53\u6570\u7ec4\u5df2\u6709\u5e8f\u65f6\u5206\u533a\u6781\u4e0d\u5e73\u8861\u3002<\/p>\n\n\n\n
      Hoare \u5212\u5206\uff08\u66f4\u9ad8\u6548\uff09<\/h3>\n\n\n\n
      \u601d\u8def<\/strong>\uff1a\u9009\u62e9\u4e2d\u95f4\u5143\u7d20\u4e3a\u57fa\u51c6\uff0c\u4f7f\u7528\u4e24\u4e2a\u6307\u9488 i<\/code> \u548c j<\/code> \u5206\u522b\u4ece\u4e24\u7aef\u5411\u4e2d\u95f4\u79fb\u52a8\uff0c\u4ea4\u6362\u6240\u6709\u9006\u5e8f\u5bf9\uff0c\u6700\u540e\u8fd4\u56de\u5206\u533a\u70b9\u3002\u8fd9\u79cd\u65b9\u6cd5\u4ea4\u6362\u6b21\u6570\u66f4\u5c11\uff0c\u901a\u5e38\u66f4\u5feb\u3002<\/p>\n\n\n\n
      int partitionHoare(int arr[], int l, int r) {\n    int pivot = arr[l + (r - l) \/ 2]; \/\/ \u9009\u4e2d\u95f4\u5143\u7d20\u907f\u514d\u6781\u7aef\u60c5\u51b5\n    int i = l - 1, j = r + 1;\n    while (true) {\n        do i++; while (arr[i] < pivot);\n        do j--; while (arr[j] > pivot);\n        if (i >= j) return j;\n        swap(arr[i], arr[j]);\n    }\n}<\/code><\/pre>\n\n\n\n
      \u6ce8\u610f\uff1aHoare \u8fd4\u56de\u7684 j<\/code> \u662f\u53f3\u534a\u90e8\u5206\u7684\u8d77\u70b9\uff0c\u9012\u5f52\u8c03\u7528\u65f6\u4e3a quickSort(arr, l, j)<\/code> \u548c quickSort(arr, j+1, r)<\/code>\u3002<\/p>\n\n\n\n
      \u4ee3\u7801\u5b9e\u73b0<\/h2>\n\n\n\n
      \u7ecf\u5178\u9012\u5f52\u5feb\u901f\u6392\u5e8f\uff08Lomuto \u5212\u5206\uff09<\/h3>\n\n\n\n
      #include <iostream>\nusing namespace std;\n\nvoid swap(int &a, int &b) {\n    int t = a; a = b; b = t;\n}\n\nint partition(int arr[], int l, int r) {\n    int pivot = arr[r];\n    int i = l;\n    for (int j = l; j < r; ++j) {\n        if (arr[j] <= pivot) {\n            swap(arr[i], arr[j]);\n            ++i;\n        }\n    }\n    swap(arr[i], arr[r]);\n    return i;\n}\n\nvoid quickSort(int arr[], int l, int r) {\n    if (l >= r) return;\n    int p = partition(arr, l, r);\n    quickSort(arr, l, p - 1);\n    quickSort(arr, p + 1, r);\n}\n\nint main() {\n    int arr[] = {5, 3, 8, 6, 2, 7, 1, 4};\n    int n = sizeof(arr) \/ sizeof(arr[0]);\n    quickSort(arr, 0, n - 1);\n    for (int i = 0; i < n; ++i)\n        cout << arr[i] << \" \";\n    return 0;\n}<\/code><\/pre>\n\n\n\n
      \u968f\u673a\u5316\u5feb\u901f\u6392\u5e8f\uff08\u63a8\u8350\u7ade\u8d5b\u4f7f\u7528\uff09<\/h3>\n\n\n\n
      \u4e3a\u907f\u514d\u6700\u574f\u60c5\u51b5\uff0c\u53ef\u4ee5\u968f\u673a\u9009\u62e9\u57fa\u51c6\u3002<\/p>\n\n\n\n
      #include <cstdlib>\n#include <ctime>\n\nint randomPartition(int arr[], int l, int r) {\n    int randomIndex = l + rand() % (r - l + 1);\n    swap(arr[randomIndex], arr[r]); \/\/ \u5c06\u968f\u673a\u57fa\u51c6\u6362\u5230\u672b\u5c3e\n    return partition(arr, l, r);    \/\/ \u8c03\u7528\u666e\u901a Lomuto \u5212\u5206\n}\n\nvoid quickSortRandom(int arr[], int l, int r) {\n    if (l >= r) return;\n    int p = randomPartition(arr, l, r);\n    quickSortRandom(arr, l, p - 1);\n    quickSortRandom(arr, p + 1, r);\n}<\/code><\/pre>\n\n\n\n
      \u4e09\u8def\u5feb\u901f\u6392\u5e8f\uff08\u5904\u7406\u5927\u91cf\u91cd\u590d\u5143\u7d20\uff09<\/h3>\n\n\n\n
      \u5f53\u6570\u7ec4\u6709\u8bb8\u591a\u76f8\u7b49\u5143\u7d20\u65f6\uff0c\u4e09\u8def\u5212\u5206\u5c06\u7b49\u4e8e\u57fa\u51c6\u7684\u5143\u7d20\u653e\u5728\u4e2d\u95f4\uff0c\u907f\u514d\u91cd\u590d\u6bd4\u8f83\u3002<\/p>\n\n\n\n
      void quickSort3Way(int arr[], int l, int r) {\n    if (l >= r) return;\n    int pivot = arr[l];\n    int lt = l;     \/\/ arr[l+1..lt] < pivot\n    int i = l + 1;  \/\/ \u5f53\u524d\u626b\u63cf\u4f4d\u7f6e\n    int gt = r;     \/\/ arr[gt..r] > pivot\n    while (i <= gt) {\n        if (arr[i] < pivot) swap(arr[lt++], arr[i++]);\n        else if (arr[i] > pivot) swap(arr[i], arr[gt--]);\n        else i++;\n    }\n    \/\/ \u9012\u5f52\u5904\u7406 <pivot \u548c >pivot \u7684\u90e8\u5206\n    quickSort3Way(arr, l, lt - 1);\n    quickSort3Way(arr, gt + 1, r);\n}<\/code><\/pre>\n\n\n\n
      \u590d\u6742\u5ea6\u5206\u6790<\/h2>\n\n\n\n
      \u590d\u6742\u5ea6<\/th>\u503c<\/th>\u6761\u4ef6<\/th><\/tr><\/thead>
      \u65f6\u95f4\u590d\u6742\u5ea6\uff08\u5e73\u5747\uff09<\/strong><\/td>O<\/mi>(<\/mo>n<\/mi><\/mspace>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(n \\log n)<\/annotation><\/semantics><\/math><\/td>\u5212\u5206\u5e73\u8861\u65f6<\/td><\/tr>
      \u65f6\u95f4\u590d\u6742\u5ea6\uff08\u6700\u574f\uff09<\/strong><\/td>O<\/mi>(<\/mo>n<\/mi>2<\/mn><\/msup>)<\/mo><\/mrow>O(n^2)<\/annotation><\/semantics><\/math><\/td>\u6bcf\u6b21\u5212\u5206\u6781\u5ea6\u4e0d\u5e73\u8861\uff08\u5982\u5df2\u6709\u5e8f\u4e14\u9009\u62e9\u9996\u5c3e\u4e3a\u57fa\u51c6\uff09<\/td><\/tr>
      \u65f6\u95f4\u590d\u6742\u5ea6\uff08\u6700\u597d\uff09<\/strong><\/td>O<\/mi>(<\/mo>n<\/mi><\/mspace>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(n \\log n)<\/annotation><\/semantics><\/math><\/td>\u6bcf\u6b21\u5212\u5206\u90fd\u5747\u8861<\/td><\/tr>
      \u7a7a\u95f4\u590d\u6742\u5ea6<\/strong><\/td>O<\/mi>(<\/mo>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(\\log n)<\/annotation><\/semantics><\/math><\/td>\u9012\u5f52\u6808\u6df1\u5ea6\uff08\u6700\u574f O<\/mi>(<\/mo>n<\/mi>)<\/mo><\/mrow>O(n)<\/annotation><\/semantics><\/math>\uff09<\/td><\/tr>
      \u7a33\u5b9a\u6027<\/strong><\/td>\u4e0d\u7a33\u5b9a<\/strong><\/td>\u56e0\u4e3a\u4ea4\u6362\u53ef\u80fd\u6253\u4e71\u76f8\u7b49\u5143\u7d20\u7684\u76f8\u5bf9\u987a\u5e8f<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
      \u9012\u63a8\u516c\u5f0f<\/strong>\uff08\u5e73\u5747\u60c5\u51b5\uff09\uff1aT<\/mi>(<\/mo>n<\/mi>)<\/mo>=<\/mo>2<\/mn>T<\/mi>(<\/mo>n<\/mi>\/<\/mi>2<\/mn>)<\/mo>+<\/mo>O<\/mi>(<\/mo>n<\/mi>)<\/mo>\u2192<\/mo>O<\/mi>(<\/mo>n<\/mi><\/mspace>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>T(n) = 2T(n\/2) + O(n) \u2192 O(n \\log n)<\/annotation><\/semantics><\/math><\/p>\n\n\n\n
      \u6700\u574f\u60c5\u51b5<\/strong>\uff1a\u5f53\u6570\u7ec4\u5df2\u7ecf\u6709\u5e8f\u6216\u9006\u5e8f\uff0c\u4e14\u6bcf\u6b21\u9009\u6700\u5de6\u6216\u6700\u53f3\u4e3a\u57fa\u51c6\uff0c\u5212\u5206\u5f97\u5230 T<\/mi>(<\/mo>n<\/mi>)<\/mo>=<\/mo>T<\/mi>(<\/mo>n<\/mi>\u2212<\/mo>1<\/mn>)<\/mo>+<\/mo>O<\/mi>(<\/mo>n<\/mi>)<\/mo>\u2192<\/mo>O<\/mi>(<\/mo>n<\/mi>2<\/mn><\/msup>)<\/mo><\/mrow>T(n) = T(n-1) + O(n) \u2192 O(n^2)<\/annotation><\/semantics><\/math><\/p>\n\n\n\n
      \u5feb\u901f\u6392\u5e8f\u7684\u7279\u70b9<\/h2>\n\n\n\n
      \u4f18\u70b9<\/h3>\n\n\n\n
        \n
      • \u539f\u5730\u6392\u5e8f<\/strong>\uff1a\u4e0d\u9700\u8981\u989d\u5916\u6570\u7ec4\uff08\u9012\u5f52\u6808\u9664\u5916\uff09\uff0c\u7a7a\u95f4\u6548\u7387\u9ad8\u3002<\/li>\n\n\n\n
      • \u5e73\u5747\u6027\u80fd\u6700\u597d<\/strong>\uff1a\u5b9e\u9645\u8fd0\u884c\u901f\u5ea6\u6bd4\u5f52\u5e76\u6392\u5e8f\u3001\u5806\u6392\u5e8f\u90fd\u5feb\uff08\u5e38\u6570\u56e0\u5b50\u5c0f\uff09\u3002<\/li>\n\n\n\n
      • \u7f13\u5b58\u53cb\u597d<\/strong>\uff1a\u987a\u5e8f\u8bbf\u95ee\u5185\u5b58\uff0c\u5c40\u90e8\u6027\u597d\u3002<\/li>\n\n\n\n
      • \u53ef\u4ee5\u4f18\u5316<\/strong>\uff1a\u7ed3\u5408\u63d2\u5165\u6392\u5e8f\u3001\u968f\u673a\u5316\u57fa\u51c6\u3001\u4e09\u8def\u5212\u5206\u7b49\uff0c\u9002\u5408\u5de5\u7a0b\u5e94\u7528\u3002<\/li>\n<\/ul>\n\n\n\n
        \u7f3a\u70b9<\/h3>\n\n\n\n
          \n
        • \u4e0d\u7a33\u5b9a<\/strong>\uff1a\u4e0d\u80fd\u4fdd\u8bc1\u76f8\u7b49\u5143\u7d20\u7684\u539f\u59cb\u987a\u5e8f\u3002<\/li>\n\n\n\n
        • \u6700\u574f\u60c5\u51b5\u5dee<\/strong>\uff1a\u4f46\u901a\u8fc7\u968f\u673a\u5316\u6216\u4e09\u6570\u53d6\u4e2d\u57fa\u672c\u53ef\u4ee5\u907f\u514d\u3002<\/li>\n\n\n\n
        • \u9012\u5f52\u6df1\u5ea6<\/strong>\uff1a\u6700\u574f\u6df1\u5ea6 $O(n)$\uff0c\u53ef\u6539\u7528\u8fed\u4ee3\u6216\u5c3e\u9012\u5f52\u4f18\u5316\u3002<\/li>\n<\/ul>\n\n\n\n
          \u4f18\u5316\u6280\u5de7\uff08\u7ade\u8d5b\u5e38\u89c1\uff09<\/h2>\n\n\n\n
            \n
          1. \u968f\u673a\u5316\u57fa\u51c6<\/strong>
            pivot = arr[l + rand() % (r-l+1)]<\/code> \u51e0\u4e4e\u907f\u514d\u6700\u574f\u60c5\u51b5\u3002<\/li>\n\n\n\n
          2. \u4e09\u6570\u53d6\u4e2d<\/strong>
            \u9009\u62e9 arr[l]<\/code>\u3001arr[mid]<\/code>\u3001arr[r]<\/code> \u7684\u4e2d\u4f4d\u6570\u4f5c\u4e3a\u57fa\u51c6\uff0c\u51cf\u5c11\u6781\u7aef\u6982\u7387\u3002<\/li>\n\n\n\n
          3. \u5c0f\u533a\u95f4\u6539\u7528\u63d2\u5165\u6392\u5e8f<\/strong>
            \u5f53\u5b50\u6570\u7ec4\u957f\u5ea6\u5c0f\u4e8e\u67d0\u4e2a\u9608\u503c\uff08\u5982 10~20\uff09\u65f6\uff0c\u6539\u7528\u63d2\u5165\u6392\u5e8f\uff0c\u63d0\u5347\u5c0f\u89c4\u6a21\u6570\u636e\u6548\u7387\u3002<\/li>\n<\/ol>\n\n\n\n
               if (r - l + 1 <= 16) {\n       insertionSort(arr, l, r);\n       return;\n   }<\/code><\/pre>\n\n\n\n
              \n
            1. \u5c3e\u9012\u5f52\u4f18\u5316<\/strong>
              \u5148\u9012\u5f52\u5904\u7406\u8f83\u5c0f\u7684\u5b50\u6570\u7ec4\uff0c\u518d\u8fed\u4ee3\u5904\u7406\u8f83\u5927\u7684\uff0c\u51cf\u5c11\u6808\u6df1\u5ea6\u3002<\/li>\n\n\n\n
            2. \u4e09\u8def\u5feb\u6392<\/strong>\uff08\u89c1\u4e0a\u6587\uff09
              \u5904\u7406\u5927\u91cf\u91cd\u590d\u5143\u7d20\u65f6\u6027\u80fd\u4f18\u5f02\u3002<\/li>\n<\/ol>\n\n\n\n
              \u5e94\u7528\u573a\u666f<\/h2>\n\n\n\n
                \n
              1. \u901a\u7528\u6392\u5e8f<\/strong>\uff1a\u5728\u5185\u5b58\u4e2d\u6392\u5e8f\u5927\u91cf\u6570\u636e\u65f6\u9996\u9009\u3002<\/li>\n\n\n\n
              2. \u6c42\u7b2c k \u5927\/\u5c0f\u7684\u5143\u7d20\uff08\u5feb\u901f\u9009\u62e9\uff09<\/strong>\uff1a\u57fa\u4e8e partition \u7684\u7ebf\u6027\u7b97\u6cd5\u3002<\/li>\n\n\n\n
              3. \u90e8\u5206\u6392\u5e8f<\/strong>\uff1a\u5982\u53ea\u5173\u5fc3\u524d k \u4e2a\u6700\u5c0f\u5143\u7d20\u3002<\/li>\n\n\n\n
              4. \u4f5c\u4e3a\u5176\u4ed6\u7b97\u6cd5\u7684\u57fa\u7840<\/strong>\uff1a\u5982\u5feb\u901f\u6392\u5e8f\u7684\u53d8\u4f53\u7528\u4e8e\u6784\u9020\u7b1b\u5361\u5c14\u6811\u7b49\u3002<\/li>\n<\/ol>\n\n\n\n
                \u5feb\u901f\u9009\u62e9\u7b97\u6cd5\uff08\u6c42\u7b2c k \u5c0f\uff09<\/h3>\n\n\n\n
                int quickSelect(int arr[], int l, int r, int k) {\n    if (l == r) return arr[l];\n    int p = partition(arr, l, r);  \/\/ \u8fd4\u56de\u57fa\u51c6\u4e0b\u6807\n    if (k == p) return arr[p];\n    else if (k < p) return quickSelect(arr, l, p - 1, k);\n    else return quickSelect(arr, p + 1, r, k);\n}\n\/\/ \u6ce8\u610f\uff1ak \u662f 0-based \u4e0b\u6807\uff0c\u6c42\u7b2c k \u5c0f\u7684\u5143\u7d20<\/code><\/pre>\n\n\n\n
                \u5feb\u901f\u6392\u5e8f vs \u5f52\u5e76\u6392\u5e8f<\/h2>\n\n\n\n
                \u7279\u6027<\/th>\u5feb\u901f\u6392\u5e8f<\/th>\u5f52\u5e76\u6392\u5e8f<\/th><\/tr><\/thead>
                \u5e73\u5747\u65f6\u95f4\u590d\u6742\u5ea6<\/td>O<\/mi>(<\/mo>n<\/mi><\/mspace>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(n \\log n)<\/annotation><\/semantics><\/math><\/td>O<\/mi>(<\/mo>n<\/mi><\/mspace>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(n \\log n)<\/annotation><\/semantics><\/math><\/td><\/tr>
                \u6700\u574f\u65f6\u95f4\u590d\u6742\u5ea6<\/td>O<\/mi>(<\/mo>n<\/mi>2<\/mn><\/msup>)<\/mo><\/mrow>O(n^2)<\/annotation><\/semantics><\/math>\uff08\u53ef\u4f18\u5316\uff09<\/td>O<\/mi>(<\/mo>n<\/mi><\/mspace>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(n \\log n)<\/annotation><\/semantics><\/math><\/td><\/tr>
                \u7a7a\u95f4\u590d\u6742\u5ea6<\/td>O<\/mi>(<\/mo>log<\/mi>\u2061<\/mo><\/mspace><\/mrow>n<\/mi>)<\/mo><\/mrow>O(\\log n)<\/annotation><\/semantics><\/math> \u6808<\/td>O<\/mi>(<\/mo>n<\/mi>)<\/mo><\/mrow>O(n)<\/annotation><\/semantics><\/math> \u8f85\u52a9\u6570\u7ec4<\/td><\/tr>
                \u7a33\u5b9a\u6027<\/td>\u4e0d\u7a33\u5b9a<\/td>\u7a33\u5b9a<\/td><\/tr>
                \u662f\u5426\u539f\u5730\u6392\u5e8f<\/td>\u662f<\/td>\u5426\uff08\u901a\u5e38\uff09<\/td><\/tr>
                \u9002\u7528\u573a\u666f<\/td>\u5185\u5b58\u5185\u901a\u7528\u6392\u5e8f\uff0c\u901f\u5ea6\u8981\u6c42\u9ad8<\/td>\u7a33\u5b9a\u6027\u8981\u6c42\uff0c\u5916\u90e8\u6392\u5e8f\uff0c\u94fe\u8868\u6392\u5e8f<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
                \u7ade\u8d5b\u5efa\u8bae<\/strong>\uff1a<\/p>\n\n\n\n
                  \n
                • \u4e00\u822c\u60c5\u51b5\u4e0b\uff0c\u76f4\u63a5\u7528 std::sort<\/code>\uff08\u5b83\u662f\u6df7\u5408\u6392\u5e8f\uff1a\u5feb\u901f\u6392\u5e8f+\u5806\u6392\u5e8f+\u63d2\u5165\u6392\u5e8f\uff09\u3002<\/li>\n\n\n\n
                • \u9700\u8981\u624b\u5199\u5feb\u6392\u65f6\uff0c\u52a1\u5fc5\u968f\u673a\u5316\u57fa\u51c6<\/strong>\uff0c\u5e76\u4f7f\u7528\u4e09\u8def\u5212\u5206<\/strong>\u5904\u7406\u91cd\u590d\u5143\u7d20\u3002<\/li>\n<\/ul>\n\n\n\n
                  \u5e38\u89c1\u8003\u9898\u53d8\u5f0f<\/h2>\n\n\n\n
                    \n
                  • \u6c42\u6570\u7ec4\u7684\u7b2c k \u5927\u5143\u7d20<\/strong>\uff1a\u5feb\u901f\u9009\u62e9\u3002<\/li>\n\n\n\n
                  • \u989c\u8272\u5206\u7c7b<\/strong>\uff08\u8377\u5170\u56fd\u65d7\u95ee\u9898\uff09\uff1a\u4e09\u8def\u5feb\u6392\u53d8\u4f53\u3002<\/li>\n\n\n\n
                  • \u4f7f\u6570\u7ec4\u6709\u5e8f\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570<\/strong>\uff1a\u53ef\u4ee5\u7ed3\u5408\u5feb\u901f\u6392\u5e8f\u601d\u60f3\u3002<\/li>\n\n\n\n
                  • \u5c06\u5947\u6570\u653e\u5728\u5076\u6570\u524d\u9762<\/strong>\uff1a\u5212\u5206\u601d\u60f3\u5e94\u7528\u3002<\/li>\n\n\n\n
                  • \u6700\u63a5\u8fd1\u4e2d\u4f4d\u6570\u7684 k \u4e2a\u6570<\/strong>\uff1a\u5feb\u901f\u9009\u62e9\u627e\u5230\u4e2d\u4f4d\u6570\uff0c\u518d\u5212\u5206\u3002<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"
                    \u5feb\u901f\u6392\u5e8f\u662f\u4e00\u79cd\u5206\u6cbb\u7b97\u6cd5\u3002\u5b83\u901a\u8fc7\u9009\u62e9\u4e00\u4e2a\u201c\u57fa\u51c6\u201d\u5143\u7d20\uff08pivot\uff09\uff0c\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u5b50\u6570\u7ec4\uff1a\u5de6\u8fb9\u6240\u6709\u5143\u7d20 \u2264 \u57fa\u51c6 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[61],"tags":[],"class_list":["post-1721","post","type-post","status-publish","format-standard","hentry","category-zl"],"_links":{"self":[{"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/posts\/1721","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/comments?post=1721"}],"version-history":[{"count":1,"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/posts\/1721\/revisions"}],"predecessor-version":[{"id":1722,"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/posts\/1721\/revisions\/1722"}],"wp:attachment":[{"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/media?parent=1721"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/categories?post=1721"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/wordpress.fangt.online\/index.php\/wp-json\/wp\/v2\/tags?post=1721"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}