如梦山河的博客

示例：实现随机数100-900之间的降序排列 package exam4; import java.util.*; public class Arr { public static void main(String[] args) { // TODO 自动生成的方法存根 Scanner reader = new Scanner(System.in);...

视频链接：https://www.bilibili.com/video/av47196993?from=search&seid=12418703498405255943 参考代码： #include <iostream> #include <algorithm> //堆heap：1，完全二叉树；2，父节点的值大于子节点得值 //parent=(i-1)/2; //c...

视频链接：https://www.bilibili.com/video/av9982752?from=search&seid=12418703498405255943 参考代码： #include<cstdio> #include<iostream> using namespace std; const int maxn = 100005; int n; int a...

#include <iostream> using namespace std; void BucketSort(int *A, int Max, int Size) { int *B=new int [Max + 1]; int i, j, count = 0; memset(B, 0, (Max + 1) * sizeof(int)); for (i = 0; i &lt...

#include <iostream> using namespace std; void shellsort(int A[], int l, int h) { if (l < h) { int d;//增量 int tmp; int j; int size = h - l + 1; for (d = size / 2; d >= 1; d /= 2)...

#include <iostream> using namespace std; int a[] = { 70,30,40,10,80,20,90,100,75,60,45 }; void shell_sort(int a[], int n); int main() { cout << "Before Sort: "; for (int i = 0; i <...

视频链接：https://www.bilibili.com/video/av47634289?t=460 参考代码： #include <iostream> using namespace std; int a[] = { 70,30,40,10,80,20,90,100,75,60,45 }; void insert_sort(int a[], int n) { for (int ...