Combine Quick Sort Insertion Sort : Sort Search « Collections Data Structure « Java

Combine Quick Sort Insertion Sort

Combine Quick Sort Insertion Sort
public class CombineQuickSortInsertionSort {
  private long[] data;

  private int len; 

  public CombineQuickSortInsertionSort(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) {
    int size = right - left + 1;
    if (size < 10) // insertion sort if small
      insertionSort(left, right);
    else // quicksort if large
      long median = medianOf3(left, right);
      int partition = partitionIt(left, right, median);
      recQuickSort(left, partition - 1);
      recQuickSort(partition + 1, right);

  public long medianOf3(int left, int right) {
    int center = (left + right) / 2;
    // order left & center
    if (data[left] > data[center])
      swap(left, center);
    // order left & right
    if (data[left] > data[right])
      swap(left, right);
    // order center & right
    if (data[center] > data[right])
      swap(center, right);

    swap(center, right - 1); 
    return data[right - 1]; 

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

  public int partitionIt(int left, int right, long pivot) {
    int leftPtr = left; // right of first elem
    int rightPtr = right - 1; // left of pivot
    while (true) {
      //find bigger
      while (data[++leftPtr] < pivot)
      //find smaller
      while (data[--rightPtr] > pivot)
      if (leftPtr >= rightPtr) // if pointers cross, partition done
        swap(leftPtr, rightPtr);
    swap(leftPtr, right - 1); // restore pivot
    return leftPtr; // return pivot location

  public void insertionSort(int left, int right) {
    int in, out;
    //  sorted on left of out
    for (out = left + 1; out <= right; out++) {
      long temp = data[out]; // remove marked item
      in = out; // start shifts at out
      // until one is smaller,
      while (in > left && data[in - 1] >= temp) {
        data[in] = data[in - 1]; // shift item to right
        --in; // go left one position
      data[in] = temp; // insert marked item

  public static void main(String[] args) {
    int maxSize = 16; 
    CombineQuickSortInsertionSort arr = new CombineQuickSortInsertionSort(maxSize); 

    for (int j = 0; j < maxSize; j++) 
      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.Simple version of quick sortSimple version of quick 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.