algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 14:18:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update quick_sort.js

Browse Source 
Fix indentation
This commit is contained in:
Yudong Jin
2022-12-01 22:38:01 +08:00
committed by GitHub
parent 7eea137c28
commit be8a586768
1 changed files with 19 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
codes/javascript/chapter_sorting/quick_sort.js
View File

@ -17,29 +17,29 @@ class QuickSort {
partition(nums, left, right){ partition(nums, left, right){
// 以 nums[left] 作为基准数 // 以 nums[left] 作为基准数
let i = left, j = right let i = left, j = right
while(i < j){ while(i < j){
while(i < j && nums[j] >= nums[left]){ while(i < j && nums[j] >= nums[left]){
j -= 1 // 从右向左找首个小于基准数的元素 j -= 1 // 从右向左找首个小于基准数的元素
}
while(i < j && nums[i] <= nums[left]){
i += 1 // 从左向右找首个大于基准数的元素
}
// 元素交换
this.swap(nums, i, j) // 交换这两个元素
} }
this.swap(nums, i, left) // 将基准数交换至两子数组的分界线 while(i < j && nums[i] <= nums[left]){
return i // 返回基准数的索引 i += 1 // 从左向右找首个大于基准数的元素
}
// 元素交换
this.swap(nums, i, j) // 交换这两个元素
}
this.swap(nums, i, left) // 将基准数交换至两子数组的分界线
return i // 返回基准数的索引
} }
/* 快速排序 */ /* 快速排序 */
quickSort(nums, left, right){ quickSort(nums, left, right){
// 子数组长度为 1 时终止递归 // 子数组长度为 1 时终止递归
if(left >= right) return if(left >= right) return
// 哨兵划分 // 哨兵划分
const pivot = this.partition(nums, left, right) const pivot = this.partition(nums, left, right)
// 递归左子数组、右子数组 // 递归左子数组、右子数组
this.quickSort(nums, left, pivot - 1) this.quickSort(nums, left, pivot - 1)
this.quickSort(nums, pivot + 1, right) this.quickSort(nums, pivot + 1, right)
} }
} }