Shulou(Shulou.com)05/31 Report--

This article mainly explains "how to use C++ to achieve the top ten sorting algorithms". The content of the article is simple and clear, and it is easy to learn and understand. Please follow the editor's train of thought. Let's study and learn how to use C++ to achieve the top ten sorting algorithms.

Bubbling sort / / Bubble sort / / from small to large / / average time complexity n ^ 2 best n ^ 2 / / Space complexity 1max / Inner sort, stable sort void bubbleSort (int arr [], int length) {for (int I = 0; I)

< length - 1; ++i) { for (int j = i; j < length; ++j) { if (arr[i] >

Arr [j]) {swap (arr [I], arr [j]);} select sort / / select sort / / average time complexity n ^ 2 best n ^ 2 worst n ^ 2 / space complexity 1 pound / inner sort unstable void selectSort (int arr [], int length) {for (int I = 0; I)

< length; ++i) { int minIndex = i; for (int j = i; j < length; ++j) { if (arr[minIndex] >

Arr [j]) {minIndex = j;}} swap (arr [I], arr [minIndex]);}} insert sort / / insert sort / / average time complexity n ^ 2 best n ^ 2 / / space complexity 1pm / inner sort, stable sort void insertSort (int arr [], int length) {for (int I = 1; I)

< length; ++i) { int preIndex = i - 1; int current = arr[i]; while (preIndex >

= 0 & & current = 1; step / = 2) {for (int I = step; I)

< length; ++i) { int preIndex = i - step; int current = arr[i]; while (preIndex >

= 0 & & current = right) {return;} int mid = (left + right) > 1; mergeSort (arr, left, mid); mergeSort (arr, mid + 1, right); merge (arr, left, mid, right);} void merge (int * arr, int left, int mid, int right) {int res [right-left + 1]; int left_index = left; int right_index = mid + 1; int index = 0 While (left_index

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.