快速排序法总结

很多人对算法不感冒，下面简单介绍两种常见算法的使用

  //调用快速排序法    quicksort(a, 0, a.length-1);    //for循环打印    for (int l = 0; l < a.length; l++) {        Log.d("-----", a[l] + "");    }}/** * description : 快速排序 * * @param * @param left * @param right * @return * @autor hanhui * modify :2016-6-20 */private 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);    }}private 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;}