Java Utililty Methods Quick Sort

List of utility methods to do Quick Sort

  1. HOME
  2. Java
  3. Q
  4. Quick Sort

Description

The list of methods to do Quick Sort are organized into topic(s).

Method

voidquicksort(float[] a, int[] index, int left, int right)
quicksort 
if (right <= left) {
    return;
int i = partition(a, index, left, right);
quicksort(a, index, left, i - 1);
quicksort(a, index, i + 1, right);
voidquickSort(int[] a)
Quicksorts this array. 
quickSort(a, 0, a.length);
voidquickSort(int[] a, int start, int end)
quick Sort 
int length = end - start + 1;
System.out.println(String.format("start:%s, end:%s, length:%s ", start, end, length));
if (length <= 1) {
    return;
int b[] = new int[length];
int k = 1, j = 0;
for (int i = start + 1; i <= end; i++) {
...
voidquickSort(int[] a, int start, int end, int[] p)
Implements a quicksort algorithm 
int len = end - start;
if (len < 2) {
    return;
} else {
    int startPlus1 = start + 1;
    if (len == 2) {
        if (a[start] > a[startPlus1]) {
            swap(a, start, startPlus1);
...
int[]quickSort(int[] arr, int left, int right)
quick Sort 
int dp;
if (left < right) {
    dp = partition(arr, left, right);
    quickSort(arr, left, dp - 1);
    quickSort(arr, dp + 1, right);
return arr;
voidquickSort(int[] array)
quick sort. 
quickSort(array, 0, array.length);
voidquicksort(int[] array)
quicksort 
quicksort(array, 0, array.length - 1);
int[]quickSort(int[] array)
quick Sort 
quickSort(null, array, 0, array.length - 1);
return array;
voidquickSort(int[] array, int lo0, int hi0)
quick Sort 
int lo = lo0;
int hi = hi0;
int mid;
if (hi0 > lo0) {
    mid = array[(lo0 + hi0) / 2];
    while (lo <= hi) {
        while ((lo < hi0) && (array[lo] < mid))
            ++lo;
...
voidquickSort(int[] array, int[] index, int lo0, int hi0)
Implements quicksort for an array of indices. 
int lo = lo0;
int hi = hi0;
int mid;
int help;
if (hi0 > lo0) {
    mid = array[index[(lo0 + hi0) / 2]];
    while (lo <= hi) {
        while ((array[index[lo]] < mid) && (lo < hi0)) {
...