Quick Sort

public class QuickSort {

public static void main(String args[])

{

int[] dizi = {12,45,879,36,59,123,158,41,85,500};

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

for(int i=0;i<dizi.length;i++)

{

   System.out.print(dizi[i] + " ");

}

}

private static void quickSort(int[] dizi, int alt, int ust) {

int i = alt;

int j = ust;

int h;

int pivot = dizi[(alt+ust)/2];

do{

while(dizi[i] < pivot)

i++;

while(dizi[j] > pivot)

j--;

if(i <= j)

{

h = dizi[i];

dizi[i] = dizi[j];

dizi[j] = h;

i++;

j--;

}

}while(i <= j);

if(alt <j)

quickSort(dizi, alt, j);

if(i < ust)

quickSort(dizi, i, ust);

}

}