java五种排序算法汇总工具类

以下代码由PHP站长网 52php.cn收集自互联网

现在PHP站长网小编把它分享给大家，仅供参考

public class Sort {
  public static <AnyType extends Comparable<? super AnyType>> void insertionSort(AnyType[] a) {
    insertionSort(a,a.length - 1);
  }

  private static <AnyType extends Comparable<? super AnyType>> void insertionSort(AnyType[] a,int left,int right) {
    int j;  // 记录第一个比tmp小的元素的后边一位的位置

    for (int p = left; p <= right; p++) {
      AnyType tmp = a[p];
      for (j = p; j > left && tmp.compareTo(a[j - 1]) < 0; j--) {
        a[j] = a[j - 1];
      }
      a[j] = tmp;
    }
  }

  public static <AnyType extends Comparable<? super AnyType>> void shellSort(AnyType[] arr) {
    int j;

    for (int gap = arr.length / 2; gap > 0; gap /= 2) {
      for (int i = gap; i < arr.length; i++) {
        AnyType tmp = arr[i];
        for (j = i; j >= gap && tmp.compareTo(arr[j - gap]) < 0; j -= gap) {
          arr[j] = arr[j - gap];
        }
        arr[j] = tmp;
      }
    }
  }

  private static int leftChild(int i) {
    return i * 2 + 1;
  }

  private static <AnyType extends Comparable<? super AnyType>> void perculateDown(AnyType[] arr,int i,int size) {
    AnyType tmp = arr[i];

    for (int child; (child = leftChild(i)) < size; i = child) {
      if (child != size - 1 && arr[child].compareTo(arr[child + 1]) < 0) {
        child++;
      }
      if (tmp.compareTo(arr[child]) < 0) {
        arr[i] = arr[child];
      } else {
        break;
      }
    }
    arr[i] = tmp;
  }

  public static <AnyType extends Comparable<? super AnyType>> void heapSort(AnyType[] arr) {
    for (int i = arr.length / 2; i >= 0; i--) {
      perculateDown(arr,i,arr.length);
    }
    for (int i = arr.length - 1; i >= 0; i--) {
      swapReferences(arr,i);
      perculateDown(arr,i);
    }
  }

  private static <AnyType extends Comparable<? super AnyType>> void swapReferences(AnyType[] arr,int j) {
    AnyType tmp = arr[i];
    arr[i] = arr[j];
    arr[j] = tmp;
  }

  public static <AnyType extends Comparable<? super AnyType>> void mergeSort(AnyType[] arr) {
    AnyType[] tmp = ((AnyType[]) new Comparable[arr.length]);
    mergeSort(arr,arr.length - 1,tmp);
  }

  private static <AnyType extends Comparable<? super AnyType>> void mergeSort(AnyType[] arr,int start,int end,AnyType[] tmp) {
    if (start < end) {
      int mid = (start + end) >> 1;
      mergeSort(arr,start,mid,tmp);
      mergeSort(arr,mid + 1,end,tmp);
      merge(arr,tmp);
    }
  }

  private static <AnyType extends Comparable<? super AnyType>> void merge(AnyType[] arr,int mid,AnyType[] tmp) {
    int i = start,j = mid + 1,k = start;
    while (i <= mid && j <= end) {
      if (arr[i].compareTo(arr[j]) < 0) {
        tmp[k++] = arr[i++];
      } else {
        tmp[k++] = arr[j++];
      }
    }

    while (i <= mid) {
      tmp[k++] = arr[i++];
    }

    while (j <= end) {
      tmp[k++] = arr[j++];
    }

    for (int m = start; m <= end; m++) {
      arr[m] = tmp[m];
    }
  }

  public static <AnyType extends Comparable<? super AnyType>> void quickSort(AnyType[] arr) {
    quickSort(arr,arr.length - 1);
  }

  private static <AnyType extends Comparable<? super AnyType>> void quickSort(AnyType[] arr,int right) {
    if (left + LENGTH_DIFF <= right) {

      AnyType pivot = medium(arr,left,right);

      int i = left,j = right;
      while (true) {
        while (arr[++i].compareTo(pivot) < 0);
        while (arr[--j].compareTo(pivot) > 0);

        if (i < j) {
          swapReferences(arr,j);
        } else {
          break;
        }
      }

      swapReferences(arr,right);
      quickSort(arr,i - 1);
      quickSort(arr,i + 1,right);
    } else {
      insertionSort(arr,right);
    }
  }

  private static <AnyType extends Comparable<? super AnyType>> AnyType medium(AnyType[] arr,int right) {
    int center = (left + right) / 2;
    if (arr[center].compareTo(arr[left]) < 0) {
      swapReferences(arr,center,left);
    }
    if (arr[left].compareTo(arr[right]) > 0) {
      swapReferences(arr,right);
    }
    if (arr[center].compareTo(arr[right]) < 0) {
      swapReferences(arr,right);
    }
    
    return arr[right];
  }

  private final static int LENGTH_DIFF = 20;
}

以上内容由PHP站长网【52php.cn】收集整理供大家参考研究

如果以上内容对您有帮助，欢迎收藏、点赞、推荐、分享。

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!