CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 12:19:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix the median_three mehod for quick sort (#1134)

Browse Source 
* Add the section of terminologies.

* fix format

* Fix median_three function for quick sort

* Delete docs/chapter_appendix/terminologies.md

* Update quick_sort.ts

* Update quick_sort.rs

* Update quick_sort.js
This commit is contained in:
Yudong Jin
2024-03-15 01:06:59 +08:00
committed by GitHub
parent 644eaf99ff
commit 9769e14017
12 changed files with 83 additions and 93 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/go/chapter_sorting/quick_sort.go
View File

@@ -47,12 +47,12 @@ func (q *quickSort) quickSort(nums []int, left, right int) {
/* 选取三个候选元素的中位数 */
func (q *quickSortMedian) medianThree(nums []int, left, mid, right int) int {
// 此处使用异或运算来简化代码（!= 在这里起到异或的作用）
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if (nums[left] < nums[mid]) != (nums[left] < nums[right]) {
return left
} else if (nums[mid] < nums[left]) != (nums[mid] < nums[right]) {
return mid
l, m, r := nums[left], nums[mid], nums[right]
if (l <= m && m <= r) || (r <= m && m <= l) {
return mid // m 在 l 和 r 之间
}
if (m <= l && l <= r) || (r <= l && l <= m) {
return left // l 在 m 和 r 之间
}
return right
}