u011563614的专栏

（待补全） #include #include #include using namespace std; void select_sort(int A[], int length) { int i,j,key,flag; for(i = 0; i < length - 1; i++) { key = A[i]; flag = i; for(j = i + 1; j

（待补全） #include #include #include using namespace std; void merge(int A[], int p, int q, int r)//归并排序 { int i,j,k; int n1,n2; n1 = q - p + 1; n2 = r - q; int *L = new int[n1]; int *R = new

4.1-2 use brute-force to solve the maximum_subarray problem. #include #include #include #include using namespace std; void max_subarray(int A[], int low, int high) { int profit = INT_MIN; in