cytheria43的博客

冒泡排序 void BubbleSort(int a[], int n) { for (int i = 0; i <n; i++) { for (int j = 0; j < n-i-1 ; j++) { if (a[j] > a[j+1]) swap(a[j], a[j+1]); } }}插入排序void InsertSort(...

素数判断bool is_prime(int n) { if (n < 2)return false; if (n == 2 || n == 3)return true; if ((n + 1) % 6 != 0 && (n - 1) % 6 != 0) return false;//5以后的素数肯定在6的倍数旁边， ...

void BinarySearch(int a[],int n,int key) { int left = 0, right = n-1; //初始化左右 while (left<=right) { int mid = (left + right) / 2; //二分查找的下标 if (a[mid] > key)right = mid-1; else if (a...