Java implementation for quick sort - Java Data Structure

Java examples for Data Structure:Sort

  1. HOME
  2. Java
  3. Data Structure
  4. Sort

Description

Java implementation for quick sort

Demo Code

class Quick_Sort/* w w w .  j a v  a  2 s. c  om*/
{
    // Conquer
    public static int Parition(int[] array, int left, int right)
    {
        int pivot = array[left];
        int index = right;
        int temp;

        for(int j = right; j > left; j--)
        {
            if(array[j] > pivot)
            {
                temp = array[j];
                array[j] = array[index];
                array[index] = temp;
                index--;
            }
        }

        array[left] = array[index];
        array[index] = pivot;
        return index;
    }

    // Divide array into halves
    public static void Quick(int[] array, int left, int right)
    {
        if(left < right)
        {
            int pivot = Parition(array, left, right);

            Quick(array, left, pivot - 1);
            Quick(array, pivot + 1, right);
        }
    }

    public static void QuickSort(int array[], int size)
    {
        Quick(array, 0, size - 1);
    }

    // function ro print array
    public static void Print_Array(int[] array, int size)
    {
        for(int i = 0; i < size; i++)
            System.out.print(array[i] + " ");

        System.out.println();
    }

    public static void main(String[] args)
    {
        int[] array = {2, 4, 3, 1, 6, 8, 4};
        QuickSort(array, 7);
        Print_Array(array, 7);
    }
}

Related Tutorials