快速排序代码（2021 年暑假写）

作者: 李威威 | 来源:发表于2021-08-17 00:19 被阅读0次

快速排序代码（2021 年暑假写）
Javascript基础算法排序
排序算法
IOS常见算法
php 排序算法：冒泡、快速、选择、插入（搜集于网络）
快速排序
快速排序算法的实现( Golang 和 Python )
快速排序 --- 基础实践篇
12-排序（下）：如何用快排思想在O(n)内查找第K大元素？
原生javascript实现简单的数据结构与算法

参考代码 1：

public class Solution {

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 不要忘记了递归终止条件
        if (left >= right) {
            return;
        }

        // nums[left + 1..j] < pivot
        // nums[j + 1..right] >= pivot

        int pivot = nums[left];
        int j = left;
        for (int i = left + 1; i <= right; i++) {
            if (nums[i] < pivot) {
                j++;
                swap(nums, j, i);
            }
        }
        swap(nums, left, j);
        quickSort(nums, left, j - 1);
        quickSort(nums, j + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}

参考代码 2：

import java.util.Random;

public class Solution {

    private static final Random random = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 递归终止条件
        if (left >= right) {
            return;
        }

        // nums[left + 1..j] < pivot
        // nums[j + 1..right] >= pivot

        // [0..right - left + 1)
        // [left..right + 1) = [left..right]
        int randomIndex = left + random.nextInt(right - left + 1);
        swap(nums, left, randomIndex);
        int pivot = nums[left];
        int j = left;
        for (int i = left + 1; i <= right; i++) {
            if (nums[i] < pivot) {
                j++;
                swap(nums, j, i);
            }
        }
        swap(nums, left, j);
        quickSort(nums, left, j - 1);
        quickSort(nums, j + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}

循环不变量修改以后（代码特别别扭）

import java.util.Random;

public class Solution {

    private static final Random random = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 递归终止条件
        if (left >= right) {
            return;
        }

        // nums[left + 1..j) <= pivot
        // nums[j..right] > pivot

        // [0..right - left + 1)
        // [left..right + 1) = [left..right]
        int randomIndex = left + random.nextInt(right - left + 1);
        swap(nums, left, randomIndex);
        int pivot = nums[left];
        int j = left + 1;
        for (int i = left + 1; i <= right; i++) {
            if (nums[i] <= pivot) {
                swap(nums, j, i);
                j++;
            }
        }
        swap(nums, left, j - 1);
        quickSort(nums, left, j - 2);
        quickSort(nums, j, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}

import java.util.Random;

public class Solution {

    private static final Random random = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 递归终止条件
        if (left >= right) {
            return;
        }
        int randomIndex = left + random.nextInt(right - left + 1);
        swap(nums, left, randomIndex);
        int pivot = nums[left];


        // 把 pivot 等概率分到两边
        // nums[left + 1..le]<= pivot
        // nums[ge..right] >= pivot

        // 为了看到下一个元素
        int le = left + 1;
        int ge = right;
        while (le <= ge) {
            while (le <= ge && nums[le] < pivot) {
                le++;
            }
            while (le <= ge && nums[ge] > pivot) {
                ge--;
            }
            if (le >= ge) {
                break;
            }
            swap(nums, le, ge);
            le++;
            ge--;
        }
        swap(nums, left, ge);
        quickSort(nums, left, ge - 1);
        quickSort(nums, ge + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}

import java.util.Random;

public class Solution {

    private static final Random random = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 递归终止条件
        if (left >= right) {
            return;
        }
        int randomIndex = left + random.nextInt(right - left + 1);
        swap(nums, left, randomIndex);
        int pivot = nums[left];


        // 把 pivot 等概率分到两边
        // nums[left + 1..lt] < pivot
        // nums[lt + 1..i) == pivot
        // nums[gt..right] > pivot

        // 为了看到下一个元素
        int lt = left;
        int gt = right + 1;
        int i = left + 1;
        while (i < gt) {
            if (nums[i] < pivot) {
                lt++;
                swap(nums, i, lt);
                i++;
            } else if (nums[i] == pivot) {
                i++;
            } else {
                gt--;
                swap(nums, i, gt);
            }
        }
        swap(nums, left, lt);
        quickSort(nums, left, lt - 1);
        quickSort(nums, gt, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}

import java.util.Random;

public class Solution {

    private static final Random random = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 递归终止条件
        if (left >= right) {
            return;
        }
        int randomIndex = left + random.nextInt(right - left + 1);
        swap(nums, left, randomIndex);
        int pivot = nums[left];


        // 把 pivot 等概率分到两边
        // nums[left + 1..lt) < pivot
        // nums[lt..i) == pivot
        // nums(gt..right] > pivot

        // 为了看到下一个元素
        int lt = left + 1;
        int gt = right;
        int i = left + 1;
        while (i <= gt) {
            if (nums[i] < pivot) {
                swap(nums, i, lt);
                lt++;
                i++;
            } else if (nums[i] == pivot) {
                i++;
            } else {
                swap(nums, i, gt);
                gt--;
            }
        }
        swap(nums, left, lt - 1);
        quickSort(nums, left, lt - 2);
        quickSort(nums, gt + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}

还未优化：

public class Solution7 {

    // 快速排序

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 优化 1 ：改成插入排序
        if (right - left + 1 <= 16) {
            insertionSort(nums, left, right);
            return;
        }

        int pivot = nums[left];
        // nums[left + 1..j] < pivot
        // nums[j + 1..right] >= pivot
        int j = left;
        for (int i = left + 1; i <= right; i++) {
            if (nums[i] < pivot) {
                j++;
                swap(nums, i, j);
            }
        }
        swap(nums, left, j);
        quickSort(nums, left, j - 1);
        quickSort(nums, j + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }

    private void insertionSort(int[] nums, int left, int right) {
        for (int i = left + 1; i <= right; i++) {
            int temp = nums[i];
            int j;
            for (j = i; j > left && nums[j - 1] > temp; j--) {
                nums[j] = nums[j - 1];
            }
            nums[j] = temp;
        }
    }
}

优化 1：加上随机化

import java.util.Random;

public class Solution {

    // 快速排序

    private static final Random RANDOM = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 优化 1 ：改成插入排序
        if (right - left + 1 <= 16) {
            insertionSort(nums, left, right);
            return;
        }

        // [0..right - left]
        // [left..right]

        int randomIndex = left + RANDOM.nextInt(right - left + 1);
        swap(nums, left, randomIndex);

        int pivot = nums[left];
        // nums[left + 1..j] < pivot
        // nums[j + 1..right] >= pivot
        int j = left;
        for (int i = left + 1; i <= right; i++) {
            if (nums[i] < pivot) {
                j++;
                swap(nums, i, j);
            }
        }
        swap(nums, left, j);
        quickSort(nums, left, j - 1);
        quickSort(nums, j + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }

    private void insertionSort(int[] nums, int left, int right) {
        for (int i = left + 1; i <= right; i++) {
            int temp = nums[i];
            int j;
            for (j = i; j > left && nums[j - 1] > temp; j--) {
                nums[j] = nums[j - 1];
            }
            nums[j] = temp;
        }
    }
}

双路快排：

import java.util.Random;

public class Solution {

    // 快速排序

    private static final Random RANDOM = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 优化 1 ：改成插入排序
        if (right - left + 1 <= 16) {
            insertionSort(nums, left, right);
            return;
        }

        // [0..right - left]
        // [left..right]

        int randomIndex = left + RANDOM.nextInt(right - left + 1);
        swap(nums, left, randomIndex);

        int pivot = nums[left];
        // nums[left + 1..i] <= pivot
        // nums[j..right] >= pivot
        int i = left + 1;
        int j = right;

        while (i <= j) {
            while (i <= j && nums[i] < pivot) {
                i++;
            }
            while (i <= j && nums[j] > pivot) {
                j--;
            }
            
            // 这里很关键
            if (i >= j) {
                break;
            }
            swap(nums, i, j);
            i++;
            j--;
        }
        swap(nums, left, j);
        quickSort(nums, left, j - 1);
        quickSort(nums, j + 1, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }

    private void insertionSort(int[] nums, int left, int right) {
        for (int i = left + 1; i <= right; i++) {
            int temp = nums[i];
            int j;
            for (j = i; j > left && nums[j - 1] > temp; j--) {
                nums[j] = nums[j - 1];
            }
            nums[j] = temp;
        }
    }
}

三路快排：

import java.util.Random;

public class Solution {

    // 快速排序

    private static final Random RANDOM = new Random();

    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quickSort(nums, 0, len - 1);
        return nums;
    }

    private void quickSort(int[] nums, int left, int right) {
        // 优化 1 ：改成插入排序
        if (right - left + 1 <= 16) {
            insertionSort(nums, left, right);
            return;
        }

        // [0..right - left]
        // [left..right]

        int randomIndex = left + RANDOM.nextInt(right - left + 1);
        swap(nums, left, randomIndex);

        int pivot = nums[left];
        // nums[left + 1..lt] < pivot
        // nums[lt + 1..i) == pivot
        // nums[gt..right] >= pivot
        int lt = left;
        int gt = right + 1;
        int i = left + 1;
        while (i < gt) {
            if (nums[i] < pivot) {
                lt++;
                swap(nums, lt, i);
                i++;
            } else if (nums[i] == pivot) {
                i++;
            } else {
                gt--;
                swap(nums, i, gt);
            }
        }
        swap(nums, left, lt);
        quickSort(nums, left, lt - 1);
        quickSort(nums, gt, right);
    }

    private void swap(int[] nums, int index1, int index2) {
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }

    private void insertionSort(int[] nums, int left, int right) {
        for (int i = left + 1; i <= right; i++) {
            int temp = nums[i];
            int j;
            for (j = i; j > left && nums[j - 1] > temp; j--) {
                nums[j] = nums[j - 1];
            }
            nums[j] = temp;
        }
    }
}

快速排序代码（2021 年暑假写）
参考代码 1：参考代码 2：循环不变量修改以后（代码特别别扭）还未优化：优化 1：加上随机化双路快排： ...
Javascript基础算法排序
代码部分快速排序冒泡排序 //选择排序
排序算法
排序 1. 选择排序代码实现 2. 插入排序代码实现 3. 冒泡排序代码实现 4. 快速排序代码实现
IOS常见算法
常见算法: 快速排序：选择排序：冒泡排序：测试代码：
php 排序算法：冒泡、快速、选择、插入（搜集于网络）
冒泡排序冒泡排序（Bubble Sorting）的基本思想是：代码：快速排序代码：选择排序选择排序（s...
快速排序
快速排序代码样例
快速排序算法的实现( Golang 和 Python )
Python 中一行代码搞定快排 Python 快速排序 Golang 快速排序
快速排序 --- 基础实践篇
本篇主要介绍快速排序的基本代码。大纲普通版的快速排序改进版的快速排序快速排序应用----求前K个最大的数 ...
12-排序（下）：如何用快排思想在O(n)内查找第K大元素？
排序操作相关代码请移步 Leooel 的博客今天写的是归并排序和快速排序，时间复杂度均为，适合大规模数据的排序...
原生javascript实现简单的数据结构与算法
最近面试被问到冒泡排序和快速排序，要求现场手撕代码。一.冒泡排序 Chrome下的测试结果：二.快速排序找出...