WZRbeliever的博客

环境：Visual Studio 2019 #include<stdio.h> #include<stdlib.h> #include<string.h> int min(int a, int b) { if (a < b) return a; else return b; } void func(int arr[], int length) { if (length < 2) return;//小于两个元素不需要排序。 int* a =

环境：Visual Studio 2019 #include<stdio.h> void func(int arr[], int length) { if (length < 2) return; int t = arr[0]; int left = 0; int right = length - 1; int flag = 2; while (left < right) { if (flag == 2) { if (arr[right] > t) { right–; cont

环境：Visual Studio 2019 #include<stdio.h> void func(int arr[], int length) { for (int i = 1; i < length; i++) { if (arr[i] < arr[i - 1]) { int t = arr[i]; int j = 0; for (j = i - 1; j >= 0 && t < arr[j]; j–) { arr[j + 1] = arr[j]; }

环境：Visual Studio 2019 #include<stdio.h> void func(int arr[], int length) { for (int i = 0; i < length; i++) { int flag = arr[i]; int left = 0; int right = i - 1; while (left <= right) { int mid = (left + right) / 2; if (flag < arr[mid]) righ

环境：Visual Studio 2019 #include<stdio.h> void func(int arr[], int length) { for (int i = 0; i < length; i++) { int m = i; for (int j = i + 1; j < length; j++) { if (arr[j] < arr[m]) m = j; } if (m == i) continue; else { int t = arr[m]; arr[m]

#include<stdio.h> void func(int arr[], int length) { for (int i = 0; i < length - 1; i++) { for (int j = 0; j < length - i - 1; j++) { if (arr[j] > arr[j + 1]) { int t = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = t; } } } } int main() { int a