How to implement Quick sort algorithm in java

This article will explain in detail how to implement the quick sorting algorithm in java. The editor thinks it is very practical, so I share it for you as a reference. I hope you can get something after reading this article.

The divide-and-conquer strategy used by the quick sorting algorithm to divide a sequence into two subsequences to achieve sorting.

Train of thought:

1. Pick an element from a series and call it a "benchmark"

two。 Reorder the series so that all elements smaller than the benchmark are placed in front of the benchmark, and all elements larger than the benchmark are placed behind the benchmark (the same number can be on either side). After this segmentation, the benchmark is its last position. This is called a split operation.

3. Recursively sorts a subsequence of elements less than the base value and a subsequence of elements greater than the base value.

Public static void quickSort (int [] numbers, int start, int end) {

If (start

< end) { int base = numbers[start]; // 选定的基准值（第一个数值作为基准值） int temp; // 记录临时中间值 int i = start, j = end; do { while ((numbers[i] < base) && (i < end)) i++; while ((numbers[j] >

Base) & & (j > start))

Jmuri-

If (I)