{"id":47993,"date":"2025-07-30T10:17:54","date_gmt":"2025-07-30T02:17:54","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/47993.html"},"modified":"2025-07-30T10:17:54","modified_gmt":"2025-07-30T02:17:54","slug":"%e5%b5%8c%e5%85%a5%e5%bc%8f%e5%bc%80%e5%8f%91%e5%ad%a6%e4%b9%a0-linux%e7%8e%af%e5%a2%83%e4%b8%8b%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e5%ad%a6%e4%b9%a0%ef%bc%88%e4%ba%94","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/47993.html","title":{"rendered":"\u5d4c\u5165\u5f0f\u5f00\u53d1\u5b66\u4e60\u2014\u2014\u2014Linux\u73af\u5883\u4e0b\u6570\u636e\u7ed3\u6784\u5b66\u4e60\uff08\u4e94\uff09"},"content":{"rendered":"

\u6298\u534a\u67e5\u627e（\u4e8c\u5206\u67e5\u627e）<\/h4>\n

\u9002\u7528\u4e8e\u5df2\u6392\u5e8f\u7684\u6570\u7ec4，\u901a\u8fc7\u4e0d\u65ad\u7f29\u5c0f\u67e5\u627e\u8303\u56f4\u5b9a\u4f4d\u76ee\u6807\u503c\u3002<\/p>\n

int binarySearch(int arr[], int size, int target) {
\n int left = 0, right = size – 1;
\n while (left <= right) {
\n int mid = left + (right – left) \/ 2;
\n if (arr[mid] == target) return mid;
\n if (arr[mid] < target) left = mid + 1;
\n else right = mid – 1;
\n }
\n return -1; \/\/ \u672a\u627e\u5230
\n}<\/p>\n

\u63d2\u5165\u6392\u5e8f<\/h4>\n

\u5c06\u672a\u6392\u5e8f\u5143\u7d20\u9010\u4e2a\u63d2\u5165\u5df2\u6392\u5e8f\u90e8\u5206\u7684\u6b63\u786e\u4f4d\u7f6e\u3002<\/p>\n

void insertionSort(int arr[], int size) {
\n for (int i = 1; i < size; i++) {
\n int key = arr[i], j = i – 1;
\n while (j >= 0 && arr[j] > key) {
\n arr[j + 1] = arr[j];
\n j–;
\n }
\n arr[j + 1] = key;
\n }
\n}<\/p>\n

\u5feb\u901f\u6392\u5e8f<\/h4>\n

\u901a\u8fc7\u5206\u6cbb\u7b56\u7565\u9009\u53d6\u57fa\u51c6\u503c，\u5c06\u6570\u7ec4\u5206\u4e3a\u5de6\u53f3\u4e24\u90e8\u5206\u9012\u5f52\u6392\u5e8f\u3002<\/p>\n

void swap(int *a, int *b) {
\n int temp = *a;
\n *a = *b;
\n *b = temp;
\n}<\/p>\n

int partition(int arr[], int low, int high) {
\n int pivot = arr[high];
\n int i = low – 1;
\n for (int j = low; j < high; j++) {
\n if (arr[j] < pivot) {
\n i++;
\n swap(&arr[i], &arr[j]);
\n }
\n }
\n swap(&arr[i + 1], &arr[high]);
\n return i + 1;
\n}<\/p>\n

void quickSort(int arr[], int low, int high) {
\n if (low < high) {
\n int pi = partition(arr, low, high);
\n quickSort(arr, low, pi – 1);
\n quickSort(arr, pi + 1, high);
\n }
\n}<\/p>\n

\u5173\u952e\u70b9<\/p>\n