\u5305\u542b\u6240\u6709\u6392\u5e8f\u7b97\u6cd5-\u4f7f\u7528Github Copilot\u751f\u6210\u3002<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nvoid InsertionSort(int arr[], int n)\n{\n int i, j;\n int get;\n for (i = 1; i < n; i++)\n {\n get = arr[i];\n for (j = i - 1; j >= 0; j--)\n {\n if (arr[j] > get)\n arr[j + 1] = arr[j];\n else\n break;\n }\n arr[j + 1] = get;\n }\n}\n\nvoid BubbleSort(int arr[], int n)\n{\n int i, j;\n for (i = 0; i < n-1; i++)\n\n \/\/ Last i elements are already in place\n for (j = 0; j < n-i-1; j++)\n if (arr[j] > arr[j+1])\n swap(arr[j], arr[j+1]);\n}\n\nvoid SelectionSort(int arr[], int n)\n{\n int i, j;\n int min;\n for (i = 0; i < n - 1; i++)\n {\n min = i;\n for (j = i + 1; j < n; j++)\n {\n if (arr[j] < arr[min])\n min = j;\n }\n if (min != i)\n swap(arr[i], arr[min]);\n }\n}\n\nvoid QuickSort(int arr[], int left, int right)\n{\n int i = left, j = right;\n int tmp;\n int pivot = arr[(left + right) \/ 2];\n\n \/* partition *\/\n while (i <= j) {\n while (arr[i] < pivot)\n i++;\n while (arr[j] > pivot)\n j--;\n if (i <= j) {\n tmp = arr[i];\n arr[i] = arr[j];\n arr[j] = tmp;\n i++;\n j--;\n }\n };\n\n \/* recursion *\/\n if (left < j)\n QuickSort(arr, left, j);\n if (i < right)\n QuickSort(arr, i, right);\n}\n\nvoid merge(int arr[], int l, int m, int r)\n{\n int i, j, k;\n int n1 = m - l + 1;\n int n2 = r - m;\n\n \/* create temp arrays *\/\n int L[n1], R[n2];\n\n \/* Copy data to temp arrays L[] and R[] *\/\n for (i = 0; i < n1; i++)\n L[i] = arr[l + i];\n for (j = 0; j < n2; j++)\n R[j] = arr[m + 1+ j];\n\n \/* Merge the temp arrays back into arr[l..r]*\/\n i = 0; \/\/ Initial index of first subarray\n j = 0; \/\/ Initial index of second subarray\n k = l; \/\/ Initial index of merged subarray\n while (i < n1 && j < n2)\n {\n if (L[i] <= R[j])\n {\n arr[k] = L[i];\n i++;\n }\n else\n {\n arr[k] = R[j];\n j++;\n }\n k++;\n }\n\n \/* Copy the remaining elements of L[], if there\n are any *\/\n while (i < n1)\n {\n arr[k] = L[i];\n i++;\n k++;\n }\n\n \/* Copy the remaining elements of R[], if there\n are any *\/\n while (j < n2)\n {\n arr[k] = R[j];\n j++;\n k++;\n }\n}\n\nvoid mergeSort(int arr[], int l, int r)\n{\n if (l < r)\n {\n \/\/ Same as (l+r)\/2, but avoids overflow for\n \/\/ large l and h\n int m = l + (r - l) \/ 2;\n\n \/\/ Sort first and second halves\n mergeSort(arr, l, m);\n mergeSort(arr, m + 1, r);\n\n merge(arr, l, m, r);\n }\n}\n\nvoid BucketSort(int arr[], int n)\n{\n int i, j;\n int count[n];\n for (i = 0; i < n; i++)\n count[i] = 0;\n\n for (i = 0; i < n; i++)\n (count[arr[i]])++;\n\n for (i = 0, j = 0; i < n; i++)\n for (; count[i] > 0; (count[i])--)\n arr[j++] = i;\n}\n\nvoid CountSort(int arr[], int n)\n{\n int i, j;\n int max = arr[0];\n int min = arr[0];\n for (i = 1; i < n; i++)\n {\n if (arr[i] > max)\n max = arr[i];\n if (arr[i] < min)\n min = arr[i];\n }\n int range = max - min + 1;\n int count[range];\n int output[n];\n for (i = 0; i < range; i++)\n count[i] = 0;\n\n for (i = 0; i < n; i++)\n count[arr[i] - min]++;\n\n for (i = 1; i < range; i++)\n count[i] += count[i - 1];\n\n for (i = n - 1; i >= 0; i--)\n {\n output[count[arr[i] - min] - 1] = arr[i];\n count[arr[i] - min]--;\n }\n\n for (i = 0; i < n; i++)\n arr[i] = output[i];\n}\n\nvoid RadixSort(int arr[], int n)\n{\n int i, j;\n int max = arr[0];\n for (i = 1; i < n; i++)\n {\n if (arr[i] > max)\n max = arr[i];\n }\n for (int exp = 1; max \/ exp > 0; exp *= 10)\n {\n int output[n];\n int count[10] = { 0 };\n\n for (i = 0; i < n; i++)\n count[(arr[i] \/ exp) % 10]++;\n\n for (i = 1; i < 10; i++)\n count[i] += count[i - 1];\n\n for (i = n - 1; i >= 0; i--)\n {\n output[count[(arr[i] \/ exp) % 10] - 1] = arr[i];\n count[(arr[i] \/ exp) % 10]--;\n }\n\n for (i = 0; i < n; i++)\n arr[i] = output[i];\n }\n}\n\nvoid Heapify(int arr[], int n, int i)\n{\n int largest = i;\n int l = 2 * i + 1;\n int r = 2 * i + 2;\n\n if (l < n && arr[l] > arr[largest])\n largest = l;\n\n if (r < n && arr[r] > arr[largest])\n largest = r;\n\n if (largest != i)\n {\n swap(arr[i], arr[largest]);\n Heapify(arr, n, largest);\n }\n}\n\nvoid Heap_sort(int arr[], int n)\n{\n for (int i = n \/ 2 - 1; i >= 0; i--)\n Heapify(arr, n, i);\n\n for (int i = n - 1; i >= 0; i--)\n {\n swap(arr[0], arr[i]);\n Heapify(arr, i, 0);\n }\n}\n\nvoid ShellSort(int arr[], int n)\n{\n for (int gap = n \/ 2; gap > 0; gap \/= 2)\n {\n for (int i = gap; i < n; i += 1)\n {\n int temp = arr[i];\n int j;\n for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)\n arr[j] = arr[j - gap];\n arr[j] = temp;\n }\n }\n}\n\nint main(){\n int n;\n cout << "Enter the number of elements: ";\n cin >> n;\n int arr[n];\n cout << "Enter the elements: ";\n for (int i = 0; i < n; i++)\n cin >> arr[i];\n int choice;\n cout << "Enter the choice of sorting algorithm: " << endl;\n cout << "1. Bubble Sort" << endl;\n cout << "2. Selection Sort" << endl;\n cout << "3. Insertion Sort" << endl;\n cout << "4. Quick Sort" << endl;\n cout << "5. Merge Sort" << endl;\n cout << "6. Bucket Sort" << endl;\n cout << "7. Count Sort" << endl;\n cout << "8. Radix Sort" << endl;\n cout << "9. Heap Sort" << endl;\n cout << "10. Shell Sort" << endl;\n cin >> choice;\n switch (choice)\n {\n case 1:\n BubbleSort(arr, n);\n break;\n case 2:\n SelectionSort(arr, n);\n break;\n case 3:\n InsertionSort(arr, n);\n break;\n case 4:\n QuickSort(arr, 0, n - 1);\n break;\n case 5:\n mergeSort(arr, 0, n - 1);\n break;\n case 6:\n BucketSort(arr, n);\n break;\n case 7:\n CountSort(arr, n);\n break;\n case 8:\n RadixSort(arr, n);\n break;\n case 9:\n Heap_sort(arr, n);\n break;\n case 10:\n ShellSort(arr, n);\n break;\n default:\n cout << "Invalid choice" << endl;\n }\n cout << "Sorted array: ";\n for (int i = 0; i < n; i++)\n cout << arr[i] << " ";\n cout << endl;\n return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u5305\u542b\u6240\u6709\u6392\u5e8f\u7b97\u6cd5-\u4f7f\u7528Github Copilot\u751f\u6210\u3002 #include<bits\/stdc++.h&…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kadence_starter_templates_imported_post":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_kad_post_classname":"","footnotes":""},"categories":[1],"tags":[],"class_list":["post-12","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/acosx.top\/index.php?rest_route=\/wp\/v2\/posts\/12","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/acosx.top\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/acosx.top\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/acosx.top\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/acosx.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=12"}],"version-history":[{"count":0,"href":"https:\/\/acosx.top\/index.php?rest_route=\/wp\/v2\/posts\/12\/revisions"}],"wp:attachment":[{"href":"https:\/\/acosx.top\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=12"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/acosx.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=12"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/acosx.top\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}