xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-06 20:54:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add build script for Go and update Go codes.

Browse Source
This commit is contained in:
krahets
2023-02-09 04:45:06 +08:00
parent 12c085a088
commit e8c78f89f0
39 changed files with 391 additions and 1468 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_sorting/quick_sort.md
+5 -64
View File
@@ -68,24 +68,7 @@ comments: true
=== "Go"
```go title="quick_sort.go"
/* 哨兵划分 */
func partition(nums []int, left, right int) int {
// 以 nums[left] 作为基准数
i, j := left, right
for i < j {
for i < j && nums[j] >= nums[left] {
j-- // 从右向左找首个小于基准数的元素
}
for i < j && nums[i] <= nums[left] {
i++ // 从左向右找首个大于基准数的元素
}
//元素交换
nums[i], nums[j] = nums[j], nums[i]
}
// 将基准数交换至两子数组的分界线
nums[i], nums[left] = nums[left], nums[i]
return i // 返回基准数的索引
}
[class]{quickSort}-[func]{partition}
```
=== "JavaScript"
@@ -169,18 +152,7 @@ comments: true
=== "Go"
```go title="quick_sort.go"
/* 快速排序 */
func quickSort(nums []int, left, right int) {
// 子数组长度为 1 时终止递归
if left >= right {
return
}
// 哨兵划分
pivot := partition(nums, left, right)
// 递归左子数组、右子数组
quickSort(nums, left, pivot-1)
quickSort(nums, pivot+1, right)
}
[class]{quickSort}-[func]{quickSort}
```
=== "JavaScript"
@@ -276,25 +248,9 @@ comments: true
=== "Go"
```go title="quick_sort.go"
/* 选取三个元素的中位数 */
func medianThree(nums []int, left, mid, right int) int {
if (nums[left] < nums[mid]) != (nums[left] < nums[right]) {
return left
} else if (nums[mid] > nums[left]) != (nums[mid] > nums[right]) {
return mid
}
return right
}
[class]{quickSortMedian}-[func]{medianThree}
/* 哨兵划分（三数取中值）*/
func partition(nums []int, left, right int) int {
// 以 nums[left] 作为基准数
med := medianThree(nums, left, (left+right)/2, right)
// 将中位数交换至数组最左端
nums[left], nums[med] = nums[med], nums[left]
// 以 nums[left] 作为基准数
// 下同省略...
}
[class]{quickSortMedian}-[func]{partition}
```
=== "JavaScript"
@@ -368,22 +324,7 @@ comments: true
=== "Go"
```go title="quick_sort.go"
/* 快速排序（尾递归优化）*/
func quickSort(nums []int, left, right int) {
// 子数组长度为 1 时终止
for left < right {
// 哨兵划分操作
pivot := partition(nums, left, right)
// 对两个子数组中较短的那个执行快排
if pivot-left < right-pivot {
quickSort(nums, left, pivot-1) // 递归排序左子数组
left = pivot + 1 // 剩余待排序区间为 [pivot + 1, right]
} else {
quickSort(nums, pivot+1, right) // 递归排序右子数组
right = pivot - 1 // 剩余待排序区间为 [left, pivot - 1]
}
}
}
[class]{quickSortTailCall}-[func]{quickSort}
```
=== "JavaScript"