Fisi

public class OrdenamientoBusqueda {


public void Burbuja(int []A)
{
int temp=0;

for(int i=1;i<A.length;i++)
{
for(intj=A.length-1;j>=i;j--)
{
if(A[j-1]>A[j])
{
temp=A[j-1];
A[j-1]=A[j];
A[j]=temp;
}}
}

}


public void InsercionDirecta(int A[]){

for(int i=1;i<A.length;i++)
{
int temp=A[i];
int k=i-1;
while(k>=0&& temp < A[k])
{
A[k+1]=A[k];
k--;
}

A[k+1]=temp;

}

}



public void SeleccionDirecta(int A[])
{for(int i=0;i<A.length-1;i++)
{
int menor=A[i];
int pos=i;

for(int j=i+1;j<A.length;j++)
{
if(A[j]<menor){menor=A[j];
pos=j;
}
}
A[pos]=A[i];
A[i]= menor;
}


}public void shellsort(int A[])
{


}

public void shellSort(int[] matrix)
{
for ( int increment = matrix.length / 2; increment > 0; increment =(increment == 2 ? 1 : (int) Math.round(increment / 2.2)))
{
for (int i = increment; i < matrix.length; i++)
{
for (int j = i; j >= increment && matrix[j -increment] >matrix[j]; j -= increment)
{
int temp = matrix[j];
matrix[j] = matrix[j - increment];
matrix[j - increment] = temp;}
}
}
}


public void quicksort(int data[],int inf,int sup)
{

int left,rigth;
double half;

left=inf;
rigth=sup;...