net.bramp.unsafe.sort

Class InplaceQuickSort

java.lang.Object

net.bramp.unsafe.sort.InplaceQuickSort

public class InplaceQuickSort
extends Object

Java program to Sort integer array using QuickSort algorithm using recursion. Recursive QuickSort algorithm, partitioned list into two parts by a pivot, and then recursively sorts each list.

Author:

Javin Paul

Constructor Summary

Constructors

Constructor and Description
InplaceQuickSort()

Method Summary

Modifier and Type	Method and Description
static <E extends Comparable<E>> int	partition(InplaceList<E> array, int left, int right) Divides array from pivot, left side contains elements less than Pivot while right side contains elements greater than pivot.
static <E extends Comparable<E>> void	quickSort(InplaceList<E> array) Sorts given array using QuickSort
static <E extends Comparable<E>> void	recursiveQuickSort(InplaceList<E> array, int startIdx, int endIdx) Recursive quicksort logic

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

InplaceQuickSort

public InplaceQuickSort()

Method Detail

quickSort

public static <E extends Comparable<E>> void quickSort(InplaceList<E> array)

Sorts given array using QuickSort

Type Parameters:

E - generic type of list

Parameters:

array - to be sorted.

recursiveQuickSort

public static <E extends Comparable<E>> void recursiveQuickSort(InplaceList<E> array,
                                                                int startIdx,
                                                                int endIdx)

Recursive quicksort logic

Type Parameters:

E - generic type of list

Parameters:

array - input array

startIdx - start index of the array

endIdx - end index of the array

partition

public static <E extends Comparable<E>> int partition(InplaceList<E> array,
                                                      int left,
                                                      int right)

Divides array from pivot, left side contains elements less than Pivot while right side contains elements greater than pivot.

Type Parameters:

E - generic type of list

Parameters:

array - array to partitioned

left - lower bound of the array

right - upper bound of the array

Returns:

the partition index