快速排序

来源：互联网发布：linux退出文本编辑编辑：程序博客网时间：2024/04/30 11:17

快速排序，直接可以拿去运行的。

public class test {        static void quicksort(int n[], int left, int right) {        int dp;        if (left < right) {            dp = partition(n, left, right);            quicksort(n, left, dp - 1);            quicksort(n, dp + 1, right);        }    }     static int partition(int n[], int left, int right) {        int pivot = n[left];        while (left < right) {            while (left < right && n[right] >= pivot)                right--;            if (left < right)                n[left++] = n[right];            while (left < right && n[left] <= pivot)                left++;            if (left < right)                n[right--] = n[left];        }        n[left] = pivot;        return left;    }        public static void main(String[] args){                int[] a = {1,3,5,2,9,6,11,6,8,4,0};        quicksort(a,0,a.length-1);        for(int i=0;i<a.length;i++){            System.out.print(a[i]+"; ");        }    }}

0 0