1 快速排序(数据过多)分析整体排序,快速排序递归层次过多改为堆栈排序
2 整体排序后,如果剩余16个记录(数据过少)直接改插入排序
uppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7]
might become [4,5,6,7,0,1,2]
).
Find the minimum element.
You may assume no duplicate exists in the array.
Example 1:
Input: [3,4,5,1,2]
Output: 1
Example 2:
Input: [4,5,6,7,0,1,2]
Output: 0
期望:请找出其中最小的元素
描述:
最小值和每个元素比较一遍,
这就递归遍历 提供条件。
旁白:
注意递归遍历时间复杂度是