xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 13:26:30 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix quick_sort.py

Browse source
This commit is contained in:
krahets 2023-02-21 21:51:56 +08:00
parent b89ea3eba4
commit 0b72fef381
11 changed files with 12 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
codes/c/chapter_sorting/quick_sort.c
View file

@ -52,7 +52,7 @@ void quickSort(int nums[], int left, int right) {
/* 快速排序类（中位基准数优化） */ /* 快速排序类（中位基准数优化） */
// 选取三个元素的中位数 // 选取三个元素的中位数
int medianThree(int nums[], int left, int mid, int right) { int medianThree(int nums[], int left, int mid, int right) {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right]))
return left; return left;

2
codes/cpp/chapter_sorting/quick_sort.cpp
View file

@ -57,7 +57,7 @@ private:
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
static int medianThree(vector<int>& nums, int left, int mid, int right) { static int medianThree(vector<int>& nums, int left, int mid, int right) {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right]))
return left; return left;

2
codes/csharp/chapter_sorting/quick_sort.cs
View file

@ -63,7 +63,7 @@ class QuickSortMedian
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
static int medianThree(int[] nums, int left, int mid, int right) static int medianThree(int[] nums, int left, int mid, int right)
{ {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right]))
return left; return left;

2
codes/dart/chapter_sorting/quick_sort.dart
View file

@ -49,7 +49,7 @@ class QuickSortMedian {
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
static int _medianThree(List<int> nums, int left, int mid, int right) { static int _medianThree(List<int> nums, int left, int mid, int right) {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right]))
return left; return left;

2
codes/go/chapter_sorting/quick_sort.go
View file

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

2
codes/java/chapter_sorting/quick_sort.java
View file

@ -56,7 +56,7 @@ class QuickSortMedian {
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
static int medianThree(int[] nums, int left, int mid, int right) { static int medianThree(int[] nums, int left, int mid, int right) {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right]))
return left; return left;

2
codes/javascript/chapter_sorting/quick_sort.js
View file

@ -54,7 +54,7 @@ class QuickSortMedian {
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
medianThree(nums, left, mid, right) { medianThree(nums, left, mid, right) {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) return left; if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right])) return left;
else if ((nums[mid] < nums[left]) ^ (nums[mid] < nums[right])) return mid; else if ((nums[mid] < nums[left]) ^ (nums[mid] < nums[right])) return mid;

4
codes/python/chapter_sorting/quick_sort.py
View file

@ -40,11 +40,11 @@ class QuickSort:
class QuickSortMedian: class QuickSortMedian:
""" 选取三个元素的中位数 """ """ 选取三个元素的中位数 """
def median_three(self, nums, left, mid, right): def median_three(self, nums, left, mid, right):
# 使用了异或操作来简化代码 # 此处使用异或运算来简化代码
# 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 # 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if (nums[left] < nums[mid]) ^ (nums[left] < nums[right]): if (nums[left] < nums[mid]) ^ (nums[left] < nums[right]):
return left return left
elif (nums[mid] < nums[left]) ^ (nums[mid] > nums[right]): elif (nums[mid] < nums[left]) ^ (nums[mid] < nums[right]):
return mid return mid
return right return right

2
codes/rust/chapter_sorting/quick_sort.rs
View file

@ -47,7 +47,7 @@ impl QuickSort {
impl QuickSortMedian { impl QuickSortMedian {
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
fn median_three(nums: &mut [i32], left: usize, mid: usize, right: usize) -> usize { fn median_three(nums: &mut [i32], left: usize, mid: usize, right: usize) -> usize {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if (nums[left] < nums[mid]) ^ (nums[left] < nums[right]) { if (nums[left] < nums[mid]) ^ (nums[left] < nums[right]) {
return left; return left;

2
codes/typescript/chapter_sorting/quick_sort.ts
View file

@ -56,7 +56,7 @@ class QuickSortMedian {
/* 选取三个元素的中位数 */ /* 选取三个元素的中位数 */
medianThree(nums: number[], left: number, mid: number, right: number): number { medianThree(nums: number[], left: number, mid: number, right: number): number {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if (Number(nums[left] < nums[mid]) ^ Number(nums[left] < nums[right])) { if (Number(nums[left] < nums[mid]) ^ Number(nums[left] < nums[right])) {
return left; return left;

2
codes/zig/chapter_sorting/quick_sort.zig
View file

@ -53,7 +53,7 @@ const QuickSortMedian = struct {
// 选取三个元素的中位数 // 选取三个元素的中位数
pub fn medianThree(nums: []i32, left: usize, mid: usize, right: usize) usize { pub fn medianThree(nums: []i32, left: usize, mid: usize, right: usize) usize {
// 使用了异或操作来简化代码 // 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) != (nums[left] < nums[right])) { if ((nums[left] < nums[mid]) != (nums[left] < nums[right])) {
return left; return left;