<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta http-equiv="X-UA-Compatible" content="ie=edge">
<title>算法导论---快速排序</title>
</head>
<body>
<script type='text/javascript'>
function QuickSort(arr , p, r){
if(p < r){
q = PARTITION(arr , p , r);
QuickSort(arr , p , q-1);
QuickSort(arr , q+1 , r);
}
}
function PARTITION (arr , p ,r){
let x = arr[r]; //选取基准
let i = p - 1;
for(let j=p ; j <= r-1 ; j++){
if(arr[j] <= x){
i = i + 1;
var temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
var middle = arr[i + 1];
arr[i + 1] = arr[r];
arr[r] = middle;
return i+1;
}
var arr = [1,3,8,9,12,7,11,90,34,87,88,56,72,39]
QuickSort(arr , 0 , arr.length-1);
for(let i = 0 ; i < arr.length ; i++){
console.log(arr[i]);
}
</script>
</body>
</html>
算法导论--快速排序JS实现
最新推荐文章于 2021-04-15 10:04:56 发布