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.

這是一個快速排序的例子。紅色的符號標(biāo)記樞軸元素；在動畫開始時，選擇最右邊的元素作為支點。

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.