Internal Sorting: Quicksort-1:Sorting by Exchanging

dijk

于 2015-05-31 16:15:11 发布

阅读量506

点赞数

分类专栏： Sorting 排序算法文章标签： quicksort exchange internal sorting 快速排序

本文链接：https://blog.csdn.net/IOIO_/article/details/46289309

版权

本文介绍了快速排序算法，通过动画展示了算法过程，并探讨了选择最后一个元素作为枢轴可能导致的性能问题。文章提供了复杂性分析、伪代码、Java程序及输出结果。

摘要由CSDN通过智能技术生成

Quicksort-1:快速排序-1

Animation

quick sort
Animated visualization of the quicksort algorithm. The horizontal lines are pivot values.

这里写图片描述
Full example of quicksort on a random set of numbers. The shaded element is the pivot. It is always chosen as the last element of the partition. However, always choosing the last element in the partition as the pivot in this way results in poor performance ( $O(n^2)$ ) on already sorted arrays, or arrays of identical elements. Since sub-arrays of sorted / identical elements crop up a lot towards the end of a sorting procedure on a large set, versions of the quicksort algorithm which choose the pivot as the middle element run much more quickly than the algorithm described in this diagram on large sets of numbers.