qq_50600845的博客

#include<stdio.h> void InsertSORT(int arr[], int n) { int i, j, temp; for (i = 1; i < n; i++) { if (arr[i] < arr[i - 1]) { temp = arr[i]; for (j = i - 1; arr[j] > temp; j--) { arr[j + 1] = arr[j]; } arr[j + 1] = tem

#include<stdio.h> void bubbleSORT(int *a, int n) { int temp; for (int i = 0; i < n; i++) { for (int j = n - 1; j > i; j--) { if (a[j] < a[j - 1]) { temp = a[j]; a[j] = a[j - 1]; a[j - 1] = temp; } } } } void m

#include<stdio.h> void quickSORT(int a[], int left,int right) { int i, mid, j; i = left; j = right; mid = a[(i + j) / 2]; int temp; while (i <= j) { while (a[i] < mid)//从左到右找到大于基准点的元素 { i++; } while (a[j] > mid)//从右到左找到小于基准