摘要:
#include using namespace std; int a[10]; void quickSort(int left,int right){ int i,j,t,temp; if(left > right) return; temp = a[left]; i = left; j = right; while(i!=... 阅读全文
摘要:
#include using namespace std; int a[10]; int temp[10]; void mergeArray(int left,int right,int mid){ int i = left; int j = mid + 1; int k = 0; while( i >n; for(int i=0;i>a[i]; ... 阅读全文