这是一道关于PAT甲级考试中快速排序问题的解析，目标是找出能作为主元（pivot）的数字。主元是指在原始数据中，比其左侧所有数大且比其右侧所有数小的数。通过创建数据副本，排序后对比原数组，找出位置未变且满足条件的数字，这些数字即为主元。题目提供了输入输出规格和示例，解题思路是利用排序后的副本与原数组比较找到主元，并按升序输出。
1101 Quick Sort (25 分)
There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N distinct positive integers after a run of partition, could you tell how many elements could be the selected pivot for this partition?
For example, given N=5 and the numbers 1, 3, 2, 4, and 5. We have:
- 1 could be the pivot since there is no element to its left and all the elements to its right are larger than it;
- 3 must not be the pivot since although all the elements to its left are smaller, the number 2 to its right is less than it as well;
- 2 must not be the pivot since although all the elements to its right are larger, the number 3 to its left is larger than it as well;
- and for the similar reason, 4 and 5 could also be the pivot.
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
