u010439954的专栏

#include using namespace std;#define N 10int a[N] = {3,2,1,9,4,5,7,6,0,8};void quick(int left, int right){ int sign = a[left]; int i = left; int j = right; if(left > right) return ; while

冒泡排序：从前（后）第一个数起与其后的第二个进行比较交换，以此往后，到第二个数与其后的第二个进行比较交换。最后一个数变为极大（小）值，以此从最后排序，形成冒泡。#include using namespace std;void show(int array[], int len){ int i = 0; for(i=0; i<len; i++) { cout<<array[i]<<

思想#include using namespace std;int sign[10][10];int min = 99;void run(int a[5][4],int x, int y, int p, int q,int step){ int next[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; int tx, ty;

#include using namespace std;#define N 10void merge(int a[], int first, int mid, int end, int tmp[]){ int arr_one_first = first; int arr_one_end = mid; int arr_two_first = mid + 1; int ar