Quick Sort in Java

A very simple program that I wrote using Java to demonstrate quick sort algorithm. I hope you will find my work useful.  Thank you for all the support in my website.

I hope you will find my work useful and beneficial. If you have some questions about programming, about my work please send mu an email at jakerpomperada@gmail.comand jakerpomperada@yahoo.com. People here in the Philippines can contact me at  my mobile number 09173084360.

Thank you very much and Happy Programming.

Sample Program Output

Program Listing

QuickSort.java

package testing;

import java.util.Arrays;

import java.util.Scanner;

public class QuickSort {

public static void main(String[] args) {

 

Scanner input=new Scanner(System.in);

int x[]  =new int[5];

System.out.println();

System.out.println(" QUICK SORT IN JAVA ");

System.out.println();

for(int i=0;i<5;i++){

System.out.print("Give value in item no. " + (i+1) + " : ");

            x[i]=input.nextInt();

   }

System.out.println();

System.out.println("Original Values");

System.out.println();

System.out.println(Arrays.toString(x));

int low = 0;

int high = x.length - 1;

quickSort(x, low, high);

System.out.println();

System.out.println("Sorted Values");

System.out.println();

System.out.println(Arrays.toString(x));

input.close();

}

public static void quickSort(int[] arr, int low, int high) {

if (arr == null || arr.length == 0)

return;

if (low >= high)

return;

 

int middle = low + (high - low) / 2;

int pivot = arr[middle];

int i = low, j = high;

while (i <= j) {

while (arr[i] < pivot) {

i++;

}

while (arr[j] > pivot) {

j--;

}

if (i <= j) {

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

i++;

j--;

}

}

 

if (low < j)

quickSort(arr, low, j);

if (high > i)

quickSort(arr, i, high);

}

}