快速排序算法
2018-03-29 本文已影响0人
月明风晚
AlgorithmLargestNumber
Input: A list of numbersL.
Output: The largest number in the listL.
ifL.size= 0 return null
largest←L[0]
for each item in L, do
if item>largest , then
largest ← item
return largest
"←" denotes assignment. For instance, "largest ← item" means that the value of largest changes to the value of item.
"return" terminates the algorithm and outputs the following value.
这是一个快速排序的例子。红色的符号标记枢轴元素；在动画开始时，选择最右边的元素作为支点。
An animation of the quicksort algorithm sorting an array of randomized values. The red bars mark the pivot element; at the start of the animation, the element farthest to the right hand side is chosen as the pivot.
