首先假设tmp为数组中的第一个数为6,然后从数组两边扫描,设定两个索引值:low代表起始位置,high代表末尾位置
首先我们要获取数组的一个分界索引
首先假设从右往左开始扫描,如果扫描的值大于tmp的值并且high>low就让high减1,不满足该条件时将arr(low)赋值为arr(high)
然后从左往右开始扫描,如果扫描的值小于tmp的值并且high>low就让low加1,不满足该条件时将arr(high)赋值为arr(low)
以此循环,直到high<=low跳出,再将tmp的值赋值给arr(low)
得到的索引为:5
之后再将索引的前半段和索引的后半段做上面步骤的递归操作
前半段
后半段
scala代码如下
object QuickSort {
def getIndex(arr: Array[Int], low: Int, high: Int): Int = {
var lowTmp = low
var highTmp = high
val tmp = arr(lowTmp)
while (lowTmp < highTmp) {
while (lowTmp < highTmp && arr(highTmp) >= tmp)
highTmp -= 1
arr(lowTmp) = arr(highTmp)
while (lowTmp < highTmp && arr(lowTmp) <= tmp)
lowTmp += 1
arr(highTmp) = arr(lowTmp)
}
arr(lowTmp) = tmp
lowTmp
}
def quickSort(arr: Array[Int], low: Int, high: Int): Unit = {
if (low < high) {
val index: Int = getIndex(arr, low, high)
quickSort(arr, 0, index)
quickSort(arr, index + 1, high)
}
}
def main(args: Array[String]): Unit = {
val arr = Array[Int](6, 1, 2, 7, 9, 3, 4, 5, 10, 8)
quickSort(arr, 0, arr.length - 1)
arr.foreach(println)
}
}
结果显示: