public class Quicksort {
public void array(){
int arrNumeros[ ] ={1,4,7,4,8,9,24,35,67,96,53,24,68,100,12,58,76,54,3,2};
int arrNumerosOrdenados[ ]=quicksort(arrNumeros,0,19);
for(int i=0;i<arrNumerosOrdenados.length;i++){
System.out.println("Numero : "+arrNumerosOrdenados[i]);
}
}
public int[] quicksort(int[] a, int izq,int der){
int i=izq;
int j = der;
int centro = a[(izq+der)/2];
do{
while(a[i] < centro){
i++;
}
while(a[j] > centro){
j--;
}
if (i <= j){
int aux = a[i];
a[i] = a[j];
a[j] = aux;
i++;
j--;
}
}while (i <= j);
if(izq < j){
quicksort(a,izq,j);
}
if(i < der){
quicksort(a,i,der);
}
return a;
}
public static void main(String arg[]){
Quicksort q = new Quicksort();
q.array();
}
}