Sort_Algorithms_With_Java.zip_algorithms

package com.java.array; public class QuickSort { //排序方法，接收一个int[]参数，将会调用快速排序方法进行排序 public static void sort(int[] number){ quickSort(number, 0, number.length-1); } //快速排序方法 private static void quickSort(int[] number, int left, int right){ if (left < right){ int s = number[left]; int i = left; int j = right + 1; while(true){ //to find index of number which bigger than s at right side while(i+1 < number.length && number[++i] < s){;} //to find index of number which less than s at left side while(j-1 > -1 && number[--j] > s){;} //if i>=j, then quit the loop if (i >= j){ break; } //else swap the elements swap(number, i, j); } number[left] = number[j]; number[j] = s; //对左边进行递归 quickSort(number,left,j-1); //对右边进行递归 quickSort(number, j+1, right); } } private static void swap(int[] number, int i, int j){ int t = number[i]; number[i] = number[j]; number[j] = t; } public static void main(String[] args){ int[] num = {34, 1, 23, 345, 12, 546 ,131, 54, 78, 6543, 321, 85, 1234, 7, 76, 234}; sort(num); for (int i=0; i<num.length; i++){ System.out.print(num[i] + " "); } } }