老6

#include<iostream> using namespace std; int *s; void Swap(int pos1,int pos2){ int temp = s[pos1]; s[pos1] = s[pos2]; s[pos2] = temp; } int Patition(int left,int right){ int i = left,j = right + 1; int temp = s[left]; while(true){ while(s[++i.

#include<iostream> using namespace std; void Merge(int *s,int *temp,int left,int mid,int right){ int lp = left; int rp = mid + 1; int k = 0; while(lp <= mid && rp <= right){ if(s[lp] <= s[rp])temp[k++] = s[lp++]; else temp[k.

#include<iostream> #include<algorithm> using namespace std; int g[20],index,n; int Bisearch(int left,int right){ int mid = (left + right)/2; if(right < left)return -1; if(g[mid] == index)return mid; else{ if(g[mid] > index)Bisearch.

#include<iostream> #include<cstdio> #define MAX_SUM 16 using namespace std; int tile = 0; int Board[MAX_SUM][MAX_SUM]; void Initial(int &size,int &dr,int &dc){ cout<<"please input the size , dr and dc"<<endl; cin>&.