diff --git a/codes/c/chapter_sorting/quick_sort.c b/codes/c/chapter_sorting/quick_sort.c
index 81202c7a05..50a95705d4 100644
--- a/codes/c/chapter_sorting/quick_sort.c
+++ b/codes/c/chapter_sorting/quick_sort.c
@@ -52,14 +52,12 @@ void quickSort(int nums[], int left, int right) {
 /* 快速排序类（中位基准数优化） */
 // 选取三个候选元素的中位数
 int medianThree(int nums[], int left, int mid, int right) {
-    // 此处使用异或运算来简化代码
-    // 异或规则为 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;
-    else
-        return right;
+    int l = nums[left], m = nums[mid], r = 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;
 }
 
 /* 哨兵划分（三数取中值） */ 
diff --git a/codes/cpp/chapter_sorting/quick_sort.cpp b/codes/cpp/chapter_sorting/quick_sort.cpp
index 32d3fb4bc1..e0b48ac246 100644
--- a/codes/cpp/chapter_sorting/quick_sort.cpp
+++ b/codes/cpp/chapter_sorting/quick_sort.cpp
@@ -57,14 +57,12 @@ class QuickSortMedian {
 
     /* 选取三个候选元素的中位数 */
     static int medianThree(vector<int> &nums, int left, int mid, int right) {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 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;
-        else
-            return right;
+        int l = nums[left], m = nums[mid], r = 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;
     }
 
     /* 哨兵划分（三数取中值） */
diff --git a/codes/csharp/chapter_sorting/quick_sort.cs b/codes/csharp/chapter_sorting/quick_sort.cs
index b9badb9f45..055c553b78 100644
--- a/codes/csharp/chapter_sorting/quick_sort.cs
+++ b/codes/csharp/chapter_sorting/quick_sort.cs
@@ -49,14 +49,12 @@ static void Swap(int[] nums, int i, int j) {
 
     /* 选取三个候选元素的中位数 */
     static int MedianThree(int[] nums, int left, int mid, int right) {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 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;
-        else
-            return right;
+        int l = nums[left], m = nums[mid], r = 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;
     }
 
     /* 哨兵划分（三数取中值） */
diff --git a/codes/dart/chapter_sorting/quick_sort.dart b/codes/dart/chapter_sorting/quick_sort.dart
index a3b49727db..5d635bf8ac 100644
--- a/codes/dart/chapter_sorting/quick_sort.dart
+++ b/codes/dart/chapter_sorting/quick_sort.dart
@@ -49,14 +49,12 @@ class QuickSortMedian {
 
   /* 选取三个候选元素的中位数 */
   static int _medianThree(List<int> nums, int left, int mid, int right) {
-    // 此处使用异或运算来简化代码
-    // 异或规则为 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;
-    else
-      return right;
+    int l = nums[left], m = nums[mid], r = 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;
   }
 
   /* 哨兵划分（三数取中值） */
diff --git a/codes/go/chapter_sorting/quick_sort.go b/codes/go/chapter_sorting/quick_sort.go
index c5eb95d3c5..f5cbf15245 100644
--- a/codes/go/chapter_sorting/quick_sort.go
+++ b/codes/go/chapter_sorting/quick_sort.go
@@ -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
 }
diff --git a/codes/java/chapter_sorting/quick_sort.java b/codes/java/chapter_sorting/quick_sort.java
index 81125d5710..a6c39c346d 100644
--- a/codes/java/chapter_sorting/quick_sort.java
+++ b/codes/java/chapter_sorting/quick_sort.java
@@ -56,14 +56,12 @@ static void swap(int[] nums, int i, int j) {
 
     /* 选取三个候选元素的中位数 */
     static int medianThree(int[] nums, int left, int mid, int right) {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 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;
-        else
-            return right;
+        int l = nums[left], m = nums[mid], r = 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;
     }
 
     /* 哨兵划分（三数取中值） */
diff --git a/codes/javascript/chapter_sorting/quick_sort.js b/codes/javascript/chapter_sorting/quick_sort.js
index 8e16220534..fd96b2d167 100644
--- a/codes/javascript/chapter_sorting/quick_sort.js
+++ b/codes/javascript/chapter_sorting/quick_sort.js
@@ -55,12 +55,14 @@ class QuickSortMedian {
 
     /* 选取三个候选元素的中位数 */
     medianThree(nums, left, mid, right) {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 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;
-        else return right;
+        let l = nums[left],
+            m = nums[mid],
+            r = nums[right];
+        // m 在 l 和 r 之间
+        if ((l <= m && m <= r) || (r <= m && m <= l)) return mid;
+        // l 在 m 和 r 之间
+        if ((m <= l && l <= r) || (r <= l && l <= m)) return left;
+        return right;
     }
 
     /* 哨兵划分（三数取中值） */
diff --git a/codes/python/chapter_sorting/quick_sort.py b/codes/python/chapter_sorting/quick_sort.py
index e2c73dc768..2c73cc1c5d 100644
--- a/codes/python/chapter_sorting/quick_sort.py
+++ b/codes/python/chapter_sorting/quick_sort.py
@@ -40,12 +40,11 @@ class QuickSortMedian:
 
     def median_three(self, nums: list[int], left: int, mid: int, right: int) -> int:
         """选取三个候选元素的中位数"""
-        # 此处使用异或运算来简化代码
-        # 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
-        if (nums[left] < nums[mid]) ^ (nums[left] < nums[right]):
-            return left
-        elif (nums[mid] < nums[left]) ^ (nums[mid] < nums[right]):
-            return mid
+        l, m, r = nums[left], nums[mid], nums[right]
+        if (l <= m <= r) or (r <= m <= l):
+            return mid  # m 在 l 和 r 之间
+        if (m <= l <= r) or (r <= l <= m):
+            return left  # l 在 m 和 r 之间
         return right
 
     def partition(self, nums: list[int], left: int, right: int) -> int:
diff --git a/codes/rust/chapter_sorting/quick_sort.rs b/codes/rust/chapter_sorting/quick_sort.rs
index 509812ea0b..cd44248e20 100644
--- a/codes/rust/chapter_sorting/quick_sort.rs
+++ b/codes/rust/chapter_sorting/quick_sort.rs
@@ -46,13 +46,13 @@ struct QuickSortMedian;
 impl QuickSortMedian {
     /* 选取三个候选元素的中位数 */
     fn median_three(nums: &mut [i32], left: usize, mid: usize, right: usize) -> usize {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 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;
-        } 
+        let (mut l, mut m, mut 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 之间
+        }
         right
     }
 
@@ -73,8 +73,8 @@ impl QuickSortMedian {
             }
             nums.swap(i, j); // 交换这两个元素
         }
-         nums.swap(i, left);  // 将基准数交换至两子数组的分界线
-         i                    // 返回基准数的索引
+        nums.swap(i, left);  // 将基准数交换至两子数组的分界线
+        i                    // 返回基准数的索引
     }
 
     /* 快速排序 */
diff --git a/codes/swift/chapter_sorting/quick_sort.swift b/codes/swift/chapter_sorting/quick_sort.swift
index 13b0a8f2af..21a72534b5 100644
--- a/codes/swift/chapter_sorting/quick_sort.swift
+++ b/codes/swift/chapter_sorting/quick_sort.swift
@@ -47,13 +47,16 @@ func quickSort(nums: inout [Int], left: Int, right: Int) {
 /* 快速排序类（中位基准数优化） */
 /* 选取三个候选元素的中位数 */
 func medianThree(nums: [Int], left: Int, mid: Int, 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
-    } else {
-        return right
+    let l = nums[left]
+    let m = nums[mid]
+    let r = 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;
 }
 
 /* 哨兵划分（三数取中值） */
diff --git a/codes/typescript/chapter_sorting/quick_sort.ts b/codes/typescript/chapter_sorting/quick_sort.ts
index 5f4e7378cb..f3ae3d8f31 100644
--- a/codes/typescript/chapter_sorting/quick_sort.ts
+++ b/codes/typescript/chapter_sorting/quick_sort.ts
@@ -62,17 +62,14 @@ class QuickSortMedian {
         mid: number,
         right: number
     ): number {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
-        if (Number(nums[left] < nums[mid]) ^ Number(nums[left] < nums[right])) {
-            return left;
-        } else if (
-            Number(nums[mid] < nums[left]) ^ Number(nums[mid] < nums[right])
-        ) {
-            return mid;
-        } else {
-            return right;
-        }
+        let l = nums[left],
+            m = nums[mid],
+            r = nums[right];
+        // m 在 l 和 r 之间
+        if ((l <= m && m <= r) || (r <= m && m <= l)) return mid;
+        // l 在 m 和 r 之间
+        if ((m <= l && l <= r) || (r <= l && l <= m)) return left;
+        return right;
     }
 
     /* 哨兵划分（三数取中值） */
diff --git a/codes/zig/chapter_sorting/quick_sort.zig b/codes/zig/chapter_sorting/quick_sort.zig
index 9ad65f5120..7f0cf59233 100644
--- a/codes/zig/chapter_sorting/quick_sort.zig
+++ b/codes/zig/chapter_sorting/quick_sort.zig
@@ -53,15 +53,14 @@ const QuickSortMedian = struct {
 
     // 选取三个候选元素的中位数
     pub fn medianThree(nums: []i32, left: usize, mid: usize, right: usize) usize {
-        // 此处使用异或运算来简化代码
-        // 异或规则为 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;
-        } else {
-            return right;
-        }
+        var l = nums[left];
+        var m = nums[mid];
+        var r = 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;
     }
 
     // 哨兵划分（三数取中值）