快速排序法(挖坑+分治)
摘要:#include<iostream>using namespace std; int adjustArray(int s[], int l, int r){ int i = l, j = r, x = s[i]; while (i<j) { while (i < j&&s[j] >= x) j--;
阅读全文
posted @ 2017-08-30 01:15
众生皆苦,唯有自渡。
posted @ 2017-08-30 01:15
posted @ 2017-08-29 23:56
posted @ 2017-08-27 17:51
posted @ 2017-08-19 17:42
posted @ 2017-08-03 12:01