Simple version of quick sort : Sort Search « Collections Data Structure « Java

Simple version of quick sort

Simple version of quick sort

public class QuickSortSimpleVersion {
  private long[] data;

  private int len;

  public QuickSortSimpleVersion(int max) {
    data = new long[max];
    len = 0;

  public void insert(long value) {
    data[len] = value; 

  public void display() {
    for (int j = 0; j < len; j++)
      System.out.print(data[j] + " ");

  public void quickSort() {
    recQuickSort(0, len - 1);

  public void recQuickSort(int left, int right) {
    if (right - left <= 0) // if size <= 1 already sorted
    else // size is 2 or larger
      long pivot = data[right]; // rightmost item
      // partition range
      int partition = partitionData(left, right, pivot);
      recQuickSort(left, partition - 1); // sort left side
      recQuickSort(partition + 1, right); // sort right side

  public int partitionData(int left, int right, long pivot) {
    int leftPtr = left - 1; // left (after ++)
    int rightPtr = right; // right-1 (after --)
    while (true) { // find bigger item
      while (data[++leftPtr] < pivot)
      // find smaller item
      while (rightPtr > 0 && data[--rightPtr] > pivot)

      if (leftPtr >= rightPtr) // if pointers cross, partition done
        swap(leftPtr, rightPtr);
    swap(leftPtr, right); // restore pivot and return pivot location
    return leftPtr;

  public void swap(int d1, int d2) {
    long temp = data[d1];
    data[d1] = data[d2];
    data[d2] = temp;

  public static void main(String[] args) {
    int maxSize = 16; // array size
    QuickSortSimpleVersion arr = new QuickSortSimpleVersion(maxSize); // create array

    for (int j = 0; j < maxSize; j++) // fill array with random numbers
      long n = (int) (java.lang.Math.random() * 99);



Related examples in the same category

1.Linear search
2.Animation for quick sort
3.Quick Sort Implementation with median-of-three partitioning and cutoff for small arrays
4.Simple Sort DemoSimple Sort Demo
5.A simple applet class to demonstrate a sort algorithm
6.Sorting an array of StringsSorting an array of Strings
7.Combine Quick Sort Insertion SortCombine Quick Sort Insertion Sort
8.Quick sort with median-of-three partitioningQuick sort with median-of-three partitioning
9.Fast Quick Sort
10.Selection sortSelection sort
11.Insert Sort for objectsInsert Sort for objects
12.Insert sortInsert sort
13.Bubble sortBubble sort
14.Merge sortMerge sort
15.Fast Merge Sort
16.Binary SearchBinary Search
17.Shell sortShell sort
18.Recursive Binary Search Implementation in Java
19.Topological sortingTopological sorting
20.Heap sortHeap sort
21.Sort NumbersSort Numbers
22.A quick sort demonstration algorithmA quick sort demonstration algorithm
23.Performing Binary Search on Java byte Array Example
24.Performing Binary Search on Java char Array Example
25.Performing Binary Search on Java double Array Example
26.Performing Binary Search on Java float Array Example
27.Performing Binary Search on Java int Array Example
28.Performing Binary Search on Java long Array Example
29.Performing Binary Search on Java short Array
30.Sort items of an array
31.Sort an array of objects
32.Sort a String array
33.Sort string array with Collator
34.Binary search routines
35.FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.
36.A binary search implementation.
37.Handles QuickSort and all of its methods.
38.Implements QuickSort three different ways
39.A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.
40.Returns an array of indices indicating the order the data should be sorted in.