Quick Sort Program in java

 Quick Sort Program in java

Code::

import java.util.*;

import java.lang.*;

import java.io.*;

//Quick Sort

class Test {

public static void main(String[] args){

int[] arr = {8,7,3,4,11,13,14,2,17};

quickSort(arr,0,arr.length-1);

for(int i : arr){

System.out.print(i+ " ");

}

}

public static void quickSort(int[] arr,int s,int e){

if(s>=e){

return;

}

int pIndex = partition(arr,s,e);

quickSort(arr,s,pIndex-1);

quickSort(arr,pIndex+1,e);

}

public static int partition(int[] arr,int s,int e){

int pivot = arr[e];

int pIndex = s;

for(int i=s;i<=e-1;i++){ 

if(arr[i] <= pivot){

int temp = arr[i];

arr[i] = arr[pIndex];

arr[pIndex] = temp;

pIndex++;

}

}

int temp = arr[e];

arr[e] = arr[pIndex];

arr[pIndex] = temp;

return pIndex;

}

}