摘要：搜索旋转排序数组 首先我们完成基本有序数组中的二分查找 int[] nums = {1,2,3,4,5,6}; int start = 0 int end = nums.length - 1; int pos = 0; while(start < end) { int mid = (start + 阅读全文

摘要：非递归快排 void Push(stack<int & s, int left, int right){ s.push(left); s.push(right); } void norecQsort(vector<int & nums, int begin, int end){ stack<int 阅读全文