Restaurante
public static void main(String[ ] args){
int aux;
int []nums = {4,9,1,2,10,15,7,3,30};
for(int i = 0; i < nums.length; i++){
for (int j = i + 1; j < nums.length;j++){
if(nums[j]< nums[i]){
aux = nums[i];
nums[i] = nums[j];
nums[j] = aux;
}
}
}
System.out.println("El metodo ordenado es:");
for (int i = 0; i < nums.length; i++){System.out.print(nums[i] + " ");
}
}
}
class Quick{
private long[] a;
private int nElems;
public Quick(int max){
a=new long[max];
nElems=max;
}
public void llenar(long value){
for(int i=0; i<value;i++)
a[i]=(int)(Math.random()*9);
}
public void display(){
for(int j=0; j<nElems; j++)
System.out.print(a[j]+", ");
System.out.println("");
}
public void quickSort(){
recQuickSort(0,nElems-1);
}
public void recQuickSort(int left, int right){
if(right-left<=0) return;
else{
long pivot=a[right];
int partition=partitionIt(left, right, pivot);
recQuickSort(left, partition-1);recQuickSort(partition+1, right);
}
}
public int partitionIt(int left, int right, long pivot){
int leftPtr=left-1;
int rightPtr=right;
while(true){
while(a[++leftPtr]<pivot);while(rightPtr>0&&a[--rightPtr]>pivot);
if(leftPtr>=rightPtr)break;
else swapqs(leftPtr, rightPtr);
}
swapqs(leftPtr, right);
return leftPtr;
}
public void swapqs(int dex1, int dex2){
longtemp=a[dex1];
a[dex1]=a[dex2];
a[dex2]=temp;
}
}
class QuickApp{
public static void main(String[] args){
int nueve=9;
Quick arr;
arr=new Quick(nueve);
arr.llenar(nueve);
arr.display();arr.quickSort();
arr.display();
}
}
public class ShellSort {
public static void main(String args[]){
int gap;
int arrayEntrada[]={321, 123, 213, 234, 1, 4, 5, 6};shellSort(arrayEntrada);
for (int i=0;i < arrayEntrada.length;i++){
System.out.print(arrayEntrada[i]+" ");
}
}
public static void shellSort( int a[ ]){
for(...
Regístrate para leer el documento completo.