摘要:
int partition(int*a, int left, int right){ int low; if (left < right){ low = left; int high = right; int value = a[left]; while (low < high){ while (l 阅读全文
摘要:
#include<iostream>#include<assert.h>using namespace std; int temp[20]; void domerge(int*a, int left, int right){ for (int i = left; i <= right; i++) t 阅读全文