METODOS DE ORDENAMIENTO
g0nzui
17 de Mayo del 2006
HOLA AMIGOS TENGO UN PROBLEMA DE COMO IMPLEMENTAR LOS DEMAS METODO DE ORDENAMIENTO, PARA ESTE PROGRAMAS COMO VERAN FALTA QUICKSORT, SACUDIDA,BINARIA ETC....
LA VERDAD NO SE COMO IMPLEMENTARLO YA QUE LO E INTENTADO Y ME MARCA ERRORES...
ALGUIEN ME AYUDA¿?
import java.io.*;
import javax.swing.*;
import java.util.prefs.*;
import java.awt.*;
import java.io.*;
import javax.swing.*;
import java.util.prefs.*;
import java.awt.*;
import java.awt.event.*;
class Ordenamiento{
String theMessage;
int messageX;
int messageY;
int compare;//guarda el numero de comparaciones
int change;//guarda el numero de intercambios
//para la eficiencia
int a,b,c,d,e,f,g,h;
//para poder saber que metodos se usan
int a1,a2,a3,a4,a5,a6,a7,a8;//a9,a10,b1,b2,b3,b4,b5,b6,b7,b8,b9,b10;
//contendra el numero de metodos utilizados
int conta;
//burbuja
int number;//guarda el dato de entrada
int aux;//variable auxiliar para los intercambios para el orden ascendente
int option;//para el menu
int aux_1;//variable auxiliar para los intercambios para el orden descendente
//insercion
int vary;//gurda momentaneamente un valor del arreglo al comparar
int J;//guarda momentaneamente un valor al hacer los intercambios
int vary_2;//para los datos de entrada
//seleccion
int menor;
int k1;
//shell
int ji,ki,salto;
//quicksort
int iz,de,pivote,tu,el,ella;
//para el tiempo que tarda un metodo en ejecutarse
long numero;
long cantidad;
long precio;
long much;
long meny;
long numero_1;
long numero_2;
long numero_3;
long numero_4;
//constructor que inicialisa todos las variables
public Ordenamiento(){
messageX=150;
messageY=120;
a1=0;
a2=0;
a3=0;
a4=0;
a5=0;
a6=0;
a7=0;
a8=0;
a=0;
b=0;
c=0;
d=0;
e=0;
f=0;
g=0;
h=0;
conta=0;
number=0;
aux=0;
option=0;
compare=0;
change=0;
aux_1=0;
vary=0;
J=0;
vary_2=0;
menor=0;
k1=0;
iz=0;
de=0;
pivote=0;
tu=0;
el=0;
ella=0;
}
//********METODO QUE GENERA NUMEROS CASI-ALEATORIOS ENTRE 0 Y 100********//
public void NumeroAl(int pin[],Ordenamiento one){
for(int i=0;i<50;i++){
double num=(Math.random()*100);
int val=(int)(num);
pin[i]=val;
}
int pile[]=new int [50];
for(int i=0;i<50;i++){
pile[i]=pin[i];
}
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+pin[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+pin[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+pin[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+pin[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+pin[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
String rango=JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"Ingresa please el rango ??\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\"Ingresar rango del arreglo\\\\\\\\\\\\\\\",JOptionPane.QUESTION_MESSAGE);
while(one.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA\\\\\\\\\\\\\\\\n2. INSERCION\\\\\\\\\\\\\\\\n3. SELECCION\\\\\\\\\\\\\\\\n4. SHELL\\\\\\\\\\\\\\\\n5. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n6. SALIR\\\\\\\\\\\\\\\");
one.option =Integer.parseInt(opcio);
switch (one.option) {
case 1:
one.order_as(pin,one);
break;
case 2:
one.order_des(pin,one);
break;
case 3:
one.INSER_AS(pin,one);
break;
case 4:
one.INSER_DES(pin,one);
break;
case 5:
one.Sel_As(pin,one);
break;
case 6:
one.Sel_Des(pin,one);
break;
case 7:
one.Shell_As(pin,one);
break;
case 8:
one.Shell_Des(pin,one);
break;
case 9:
one.Mos_Ef(pin,one);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}//fin de NumeroAl
//********METODO DE LA BURBUJA EN ORDEN DE MENOR A MAYOR*************//
public void order_as(int pi[],Ordenamiento three){
int p[]=new int [50];
for(int i=0;i<50;i++){
p[i]=pi[i];
}
three.a1++;//para saber si se utiliza este metodo
three.conta++;
three.numero = System.currentTimeMillis();
for (int cont=0;cont<50-1;cont++){
for(int X=0;X<(50-1)-cont;X++){
if(p[X]>p[X+1]){
three.aux=p[X];
p[X]=p[X+1];
p[X+1]=three.aux;
three.change++;
}
three.compare++;
}
}
long valor=(System.currentTimeMillis()-three.numero*1000);
three.a=(int)(valor);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+p[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+p[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+p[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+p[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+p[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
value+=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE LA BURBUJA EN ORDEN DE MENOR A MAYOR\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+three.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+three.change);
three.compare=0;
three.change=0;
while(three.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA\\\\\\\\\\\\\\\\n2. INSERCION\\\\\\\\\\\\\\\\n3. SELECCION\\\\\\\\\\\\\\\\n4. SHELL\\\\\\\\\\\\\\\\n5. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n6. SALIR\\\\\\\\\\\\\\\");
three.option =Integer.parseInt(opcio);
switch (three.option) {
case 1:
three.order_as(pi,three);
break;
case 2:
three.order_des(pi,three);
break;
case 3:
three.INSER_AS(pi,three);
break;
case 4:
three.INSER_DES(pi,three);
break;
case 5:
three.Sel_As(pi,three);
break;
case 6:
three.Sel_Des(pi,three);
break;
case 7:
three.Shell_As(pi,three);
break;
case 8:
three.Shell_Des(pi,three);
break;
case 9:
three.Mos_Ef(pi,three);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE LA BURBUJA EN ORDEN DE MAYOR A MENOR*************//
public void order_des(int pil[], Ordenamiento four){
int pilar[]=new int [50];
for(int x=0;x<50;x++){
pilar[x]=pil[x];
}
four.cantidad = System.currentTimeMillis();
four.a2++;
four.conta++;
for (int much=0;much<50-1;much++){
for(int Y=0;Y<(50-1)-much;Y++){
if(pilar[Y]<pilar[Y+1]){
four.aux_1=pilar[Y];
pilar[Y]=pilar[Y+1];
pilar[Y+1]=four.aux_1;
four.change++;
}
four.compare++;
}
}
long A=(System.currentTimeMillis()-four.cantidad*1000);
four.b=(int)(A);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+pilar[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+pilar[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+pilar[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+pilar[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+pilar[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
value+=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE LA BURBUJA EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+four.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+four.change);
four.change=0;
four.compare=0;
while(four.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL\\\\\\\\\\\\\\\\n9 MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
four.option =Integer.parseInt(opcio);
switch (four.option) {
case 1:
four.order_as(pil,four);
break;
case 2:
four.order_des(pil,four);
break;
case 3:
four.INSER_AS(pil,four);
break;
case 4:
four.INSER_DES(pil,four);
break;
case 5:
four.Sel_As(pil,four);
break;
case 6:
four.Sel_Des(pil,four);
break;
case 7:
four.Shell_As(pil,four);
break;
case 8:
four.Shell_Des(pil,four);
break;
case 9:
four.Mos_Ef(pil,four);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE INSRCION EN ORDEN DE MENOR A MAYOR*************//
public void INSER_AS(int DE[], Ordenamiento seven){
int CH[]=new int [50];
for(int i=0;i<50;i++){
CH[i]=DE[i];
}
seven.precio = System.currentTimeMillis();
seven.a3++;
seven.conta++;
for (int I=1;I<50;I++){
seven.vary=CH[I];
seven.J=I-1;
while((CH[seven.J]>seven.vary)&(J>=0)){
CH[seven.J+1]=CH[J];
CH[seven.J]=CH[seven.J+1];
J--;
CH[J+1]=seven.vary;
if(seven.J==-1){
seven.J=0;
}
seven.compare++;//para las comparaciones
}
seven.change++;//para los intercambios
}
long D=(System.currentTimeMillis()-seven.precio*1000);
seven.c=(int)(D);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+CH[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+CH[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+CH[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+CH[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+CH[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
value+=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE INSERCION EN ORDEN DE MENOR A MAYOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+seven.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+seven.change);
seven.compare=0;
seven.change=0;
while(seven.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_AS\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5.SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
seven.option =Integer.parseInt(opcio);
switch (seven.option) {
case 1:
seven.order_as(DE,seven);
break;
case 2:
seven.order_des(DE,seven);
break;
case 3:
seven.INSER_AS(DE,seven);
break;
case 4:
seven.INSER_DES(DE,seven);
break;
case 5:
seven.Sel_As(DE,seven);
break;
case 6:
seven.Sel_Des(DE,seven);
break;
case 7:
seven.Shell_As(DE,seven);
break;
case 8:
seven.Shell_Des(DE,seven);
break;
case 9:
seven.Mos_Ef(DE,seven);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE INSERCION EN ORDEN DE MAYOR A MENOR*************//
public void INSER_DES(int G[],Ordenamiento five){
int FA[]=new int [50];
for(int i=0;i<50;i++){
FA[i]=G[i];
}
five.much= System.currentTimeMillis();
five.a4++;
five.conta++;
for (int I=1;I<50;I++){
five.vary=FA[I];
five.J=I-1;
while(FA[five.J]<five.vary){
if(five.J>=0){
FA[five.J+1]=FA[five.J];
J--;
FA[five.J+1]=five.vary;
if(five.J==-1){
five.J=0;
}
five.change++;//para los intercambios
}
}
five.compare++;//para las comparaciones
}
long N=(System.currentTimeMillis()-five.much*1000);
five.d=(int)(N);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+FA[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+FA[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+FA[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+FA[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+FA[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE LA INSERCION EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+five.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+five.change);
/*JOptionPane.showMessageDialog(null,largo);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+five.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+five.change);*/
five.compare=0;
five.change=0;
while(five.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_AS\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
five.option =Integer.parseInt(opcio);
switch (five.option) {
case 1:
five.order_as(G,five);
break;
case 2:
five.order_des(G,five);
break;
case 3:
five.INSER_AS(G,five);
break;
case 4:
five.INSER_DES(G,five);
break;
case 5:
five.Sel_As(G,five);
break;
case 6:
five.Sel_Des(G,five);
break;
case 7:
five.Shell_As(G,five);
break;
case 8:
five.Shell_Des(G,five);
break;
case 9:
five.Mos_Ef(G,five);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE SELECCION DIRECTA EN ORDEN DE MENOR A MAYOR*************//
public void Sel_As(int H[],Ordenamiento X){
int a[]=new int[50];
for(int i=0;i<50;i++){
a[i]=H[i];
}
X.a5++;
X.conta++;
X.meny= System.currentTimeMillis();
for(int i=0;i<a.length-1;i++){
X.menor=a[i];
X.k1=i;
for(int j=i+1;j<a.length;j++){
if(a[j]<menor){
X.menor=a[j];
X.k1=j;
}
X.compare++;
}
a[X.k1]=a[i];
a[i]=X.menor;
X.change++;
}
long Ñ=(System.currentTimeMillis()-X.meny*1000);
X.e=(int)(Ñ);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+a[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+a[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+a[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+a[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+a[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE SELECCION EN ORDEN DE MENOR A MAYOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+X.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+X.change);
/*JOptionPane.showMessageDialog(null,large);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+X.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+X.change);*/
X.compare=0;
X.change=0;
while(X.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_AS\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
X.option =Integer.parseInt(opcio);
switch (X.option) {
case 1:
X.order_as(H,X);
break;
case 2:
X.order_des(H,X);
break;
case 3:
X.INSER_AS(H,X);
break;
case 4:
X.INSER_DES(H,X);
break;
case 5:
X.Sel_As(H,X);
break;
case 6:
X.Sel_Des(H,X);
break;
case 7:
X.Shell_As(H,X);
break;
case 8:
X.Shell_Des(H,X);
break;
case 9:
X.Mos_Ef(H,X);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE SELECCION DIRECTA EN ORDEN DE MAYOR A MENOR*************//
public void Sel_Des(int H[],Ordenamiento Y){
int e[]=new int[50];
for(int i=0;i<50;i++){
e[i]=H[i];
}
Y.a6++;
Y.conta++;
Y.numero_1= System.currentTimeMillis();
for(int i=0;i<e.length-1;i++){
Y.menor=e[i];
Y.k1=i;
for(int j=i+1;j<e.length;j++){
if(e[j]>Y.menor){
Y.menor=e[j];
Y.k1=j;
}
Y.compare++;
}
e[Y.k1]=e[i];
e[i]=Y.menor;
Y.change++;
}
long Oso=(System.currentTimeMillis()-Y.numero_1*1000);
Y.f=(int)(Oso);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+e[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+e[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+e[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+e[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+e[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE SELECCION EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.change);
/*JOptionPane.showMessageDialog(null,largen);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.change);*/
Y.compare=0;
Y.change=0;
while(Y.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
Y.option =Integer.parseInt(opcio);
switch (Y.option) {
case 1:
Y.order_as(H,Y);
break;
case 2:
Y.order_des(H,Y);
break;
case 3:
Y.INSER_AS(H,Y);
break;
case 4:
Y.INSER_DES(H,Y);
break;
case 5:
Y.Sel_As(H,Y);
break;
case 6:
Y.Sel_Des(H,Y);
break;
case 7:
Y.Shell_As(H,Y);
break;
case 8:
Y.Shell_Des(H,Y);
break;
case 9:
Y.Mos_Ef(H,Y);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO SHELL EN ORDEN DE MENOR A MAYOR*************//
public void Shell_As(int H[],Ordenamiento Y){
int e[]=new int[50];
for(int i=0;i<50;i++){
e[i]=H[i];
}
Y.a7++;
Y.conta++;
Y.numero_2= System.currentTimeMillis();
Y.salto=e.length/2;
while(Y.salto>0){
for(int i=Y.salto;i<e.length;i++){
Y.ji=i-Y.salto;
while(Y.ji>=0){
Y.ki=Y.ji+Y.salto;
if(e[Y.ji]<=e[Y.ki]){
Y.ji--;
Y.compare++;
}
else{
int auxi=e[Y.ji];
e[Y.ji]=e[Y.ki];
e[Y.ki]=auxi;
Y.ji-=Y.salto;
Y.change++;
}
}
}
Y.salto/=2;
}
long Ola=(System.currentTimeMillis()-Y.numero_2*1000);
Y.g=(int)(Ola);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+e[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+e[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+e[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+e[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+e[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO SHELL EN ORDEN DE MENOR A MAYOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.change);
/* JOptionPane.showMessageDialog(null,largen);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.change);*/
Y.compare=0;
Y.change=0;
while(Y.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
Y.option =Integer.parseInt(opcio);
switch (Y.option) {
case 1:
Y.order_as(H,Y);
break;
case 2:
Y.order_des(H,Y);
break;
case 3:
Y.INSER_AS(H,Y);
break;
case 4:
Y.INSER_DES(H,Y);
break;
case 5:
Y.Sel_As(H,Y);
break;
case 6:
Y.Sel_Des(H,Y);
break;
case 7:
Y.Shell_As(H,Y);
break;
case 8:
Y.Shell_Des(H,Y);
break;
case 9:
Y.Mos_Ef(H,Y);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//******** METODO SHELL EN ORDEN DE MAYOR A MENOR *************//
public void Shell_Des(int H[],Ordenamiento Y){
int e[]=new int[50];
for(int i=0;i<50;i++){
e[i]=H[i];
}
Y.a8++;
Y.conta++;
Y.numero_3= System.currentTimeMillis();
Y.salto=e.length/2;
while(Y.salto>0){
for(int i=Y.salto;i<e.length;i++){
Y.ji=i-Y.salto;
while(Y.ji>=0){
Y.ki=Y.ji+Y.salto;
if(e[Y.ji]>=e[Y.ki]){
Y.ji--;
Y.compare++;
}
else{
int auxil=e[Y.ji];
e[Y.ji]=e[Y.ki];
e[Y.ki]=auxil;
Y.ji-=Y.salto;
Y.change++;
}
}
}
Y.salto/=2;
}
long Oyo=(System.currentTimeMillis()-Y.numero_3*1000);
Y.h=(int)(Oyo);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+e[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+e[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+e[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+e[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+e[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO SHELL EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.change);
/*JOptionPane.showMessageDialog(null,largen);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.change);*/
Y.compare=0;
Y.change=0;
while(Y.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. SALIR\\\\\\\\\\\\\\\");
Y.option =Integer.parseInt(opcio);
switch (Y.option) {
case 1:
Y.order_as(H,Y);
break;
case 2:
Y.order_des(H,Y);
break;
case 3:
Y.INSER_AS(H,Y);
break;
case 4:
Y.INSER_DES(H,Y);
break;
case 5:
Y.Sel_As(H,Y);
break;
case 6:
Y.Sel_Des(H,Y);
break;
case 7:
Y.Shell_As(H,Y);
break;
case 8:
Y.Shell_Des(H,Y);
break;
case 9:
Y.Mos_Ef(H,Y);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//** METODO QUE MIESTRA EL TIEMPO DE EJECUCION DE LOS METODOS UTILIZADOS **//
public void Mos_Ef(int D[],Ordenamiento luc){
int v[]=new int [8];
String evaluar=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
int cont=-1;
int aux=0;
evaluar+=\\\\\\\\\\\\\\\"METODO \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"TIEMPO DE EJECUCION\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
while (luc.conta!=0){
if(luc.a1==1){
luc.a1--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Burbuja_1 \\\\\\\\\\\\\\\"+luc.a+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.a;
}
if(luc.a2==1){
luc.a2--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Burbuja_2 \\\\\\\\\\\\\\\"+luc.b+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.b;
}
if(luc.a3==1){
luc.a3--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Insercion_1 \\\\\\\\\\\\\\\"+luc.c+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.c;
}
if(luc.a4==1){
luc.a4--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Insercion_2 \\\\\\\\\\\\\\\"+luc.d+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.d;
}
if(luc.a5==1){
luc.a5--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Seleccion_1 \\\\\\\\\\\\\\\"+luc.e+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.e;
}
if(luc.a6==1){
luc.a6--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Seleccion_2 \\\\\\\\\\\\\\\"+luc.f+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.f;
}
if(luc.a7==1){
luc.a7--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Shell_1 \\\\\\\\\\\\\\\"+luc.g+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.g;
}
if(luc.a8==1){
luc.a8--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Shell_2 \\\\\\\\\\\\\\\"+luc.h+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.h;
}
}
int X=0;
aux=v[X];
while(X<cont){
if(aux<v[X+1]){
X++;
}
else{
X++;
aux=v[X];
}
}
String nombre=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\";
if(luc.a==aux){
nombre=\\\\\\\\\\\\\\\"Burbuja_1\\\\\\\\\\\\\\\";
}
if(luc.b==aux){
nombre=\\\\\\\\\\\\\\\"Burbuja_2\\\\\\\\\\\\\\\";
}
if(luc.c==aux){
nombre=\\\\\\\\\\\\\\\"Insercion_1\\\\\\\\\\\\\\\";
}
if(luc.d==aux){
nombre=\\\\\\\\\\\\\\\"Insercion_2\\\\\\\\\\\\\\\";
}
if(luc.e==aux){
nombre=\\\\\\\\\\\\\\\"Seleccion_1\\\\\\\\\\\\\\\";
}
if(luc.f==aux){
nombre=\\\\\\\\\\\\\\\"Seleccion_2\\\\\\\\\\\\\\\";
}
if(luc.g==aux){
nombre=\\\\\\\\\\\\\\\"Shell_1\\\\\\\\\\\\\\\";
}
if(luc.h==aux){
nombre=\\\\\\\\\\\\\\\"Shell_2\\\\\\\\\\\\\\\";
}
JOptionPane.showMessageDialog(null,evaluar+\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\\nMETODO CON MENOS TIEMPO DE EJECUCION \\\\\\\\\\\\\\\"+nombre);
System.exit(0);
}
}
//****************** CLASE PRINCIPAL*********************//
public class Implement_Order{
public static void main(String [] args){
Ordenamiento young=new Ordenamiento();
int copy[]; copy=new int[50];
young.NumeroAl(copy,young);
System.exit(0);
}
}
LA VERDAD NO SE COMO IMPLEMENTARLO YA QUE LO E INTENTADO Y ME MARCA ERRORES...
ALGUIEN ME AYUDA¿?
import java.io.*;
import javax.swing.*;
import java.util.prefs.*;
import java.awt.*;
import java.io.*;
import javax.swing.*;
import java.util.prefs.*;
import java.awt.*;
import java.awt.event.*;
class Ordenamiento{
String theMessage;
int messageX;
int messageY;
int compare;//guarda el numero de comparaciones
int change;//guarda el numero de intercambios
//para la eficiencia
int a,b,c,d,e,f,g,h;
//para poder saber que metodos se usan
int a1,a2,a3,a4,a5,a6,a7,a8;//a9,a10,b1,b2,b3,b4,b5,b6,b7,b8,b9,b10;
//contendra el numero de metodos utilizados
int conta;
//burbuja
int number;//guarda el dato de entrada
int aux;//variable auxiliar para los intercambios para el orden ascendente
int option;//para el menu
int aux_1;//variable auxiliar para los intercambios para el orden descendente
//insercion
int vary;//gurda momentaneamente un valor del arreglo al comparar
int J;//guarda momentaneamente un valor al hacer los intercambios
int vary_2;//para los datos de entrada
//seleccion
int menor;
int k1;
//shell
int ji,ki,salto;
//quicksort
int iz,de,pivote,tu,el,ella;
//para el tiempo que tarda un metodo en ejecutarse
long numero;
long cantidad;
long precio;
long much;
long meny;
long numero_1;
long numero_2;
long numero_3;
long numero_4;
//constructor que inicialisa todos las variables
public Ordenamiento(){
messageX=150;
messageY=120;
a1=0;
a2=0;
a3=0;
a4=0;
a5=0;
a6=0;
a7=0;
a8=0;
a=0;
b=0;
c=0;
d=0;
e=0;
f=0;
g=0;
h=0;
conta=0;
number=0;
aux=0;
option=0;
compare=0;
change=0;
aux_1=0;
vary=0;
J=0;
vary_2=0;
menor=0;
k1=0;
iz=0;
de=0;
pivote=0;
tu=0;
el=0;
ella=0;
}
//********METODO QUE GENERA NUMEROS CASI-ALEATORIOS ENTRE 0 Y 100********//
public void NumeroAl(int pin[],Ordenamiento one){
for(int i=0;i<50;i++){
double num=(Math.random()*100);
int val=(int)(num);
pin[i]=val;
}
int pile[]=new int [50];
for(int i=0;i<50;i++){
pile[i]=pin[i];
}
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+pin[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+pin[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+pin[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+pin[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+pin[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
String rango=JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"Ingresa please el rango ??\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\"Ingresar rango del arreglo\\\\\\\\\\\\\\\",JOptionPane.QUESTION_MESSAGE);
while(one.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA\\\\\\\\\\\\\\\\n2. INSERCION\\\\\\\\\\\\\\\\n3. SELECCION\\\\\\\\\\\\\\\\n4. SHELL\\\\\\\\\\\\\\\\n5. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n6. SALIR\\\\\\\\\\\\\\\");
one.option =Integer.parseInt(opcio);
switch (one.option) {
case 1:
one.order_as(pin,one);
break;
case 2:
one.order_des(pin,one);
break;
case 3:
one.INSER_AS(pin,one);
break;
case 4:
one.INSER_DES(pin,one);
break;
case 5:
one.Sel_As(pin,one);
break;
case 6:
one.Sel_Des(pin,one);
break;
case 7:
one.Shell_As(pin,one);
break;
case 8:
one.Shell_Des(pin,one);
break;
case 9:
one.Mos_Ef(pin,one);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}//fin de NumeroAl
//********METODO DE LA BURBUJA EN ORDEN DE MENOR A MAYOR*************//
public void order_as(int pi[],Ordenamiento three){
int p[]=new int [50];
for(int i=0;i<50;i++){
p[i]=pi[i];
}
three.a1++;//para saber si se utiliza este metodo
three.conta++;
three.numero = System.currentTimeMillis();
for (int cont=0;cont<50-1;cont++){
for(int X=0;X<(50-1)-cont;X++){
if(p[X]>p[X+1]){
three.aux=p[X];
p[X]=p[X+1];
p[X+1]=three.aux;
three.change++;
}
three.compare++;
}
}
long valor=(System.currentTimeMillis()-three.numero*1000);
three.a=(int)(valor);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+p[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+p[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+p[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+p[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+p[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
value+=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE LA BURBUJA EN ORDEN DE MENOR A MAYOR\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+three.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+three.change);
three.compare=0;
three.change=0;
while(three.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA\\\\\\\\\\\\\\\\n2. INSERCION\\\\\\\\\\\\\\\\n3. SELECCION\\\\\\\\\\\\\\\\n4. SHELL\\\\\\\\\\\\\\\\n5. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n6. SALIR\\\\\\\\\\\\\\\");
three.option =Integer.parseInt(opcio);
switch (three.option) {
case 1:
three.order_as(pi,three);
break;
case 2:
three.order_des(pi,three);
break;
case 3:
three.INSER_AS(pi,three);
break;
case 4:
three.INSER_DES(pi,three);
break;
case 5:
three.Sel_As(pi,three);
break;
case 6:
three.Sel_Des(pi,three);
break;
case 7:
three.Shell_As(pi,three);
break;
case 8:
three.Shell_Des(pi,three);
break;
case 9:
three.Mos_Ef(pi,three);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE LA BURBUJA EN ORDEN DE MAYOR A MENOR*************//
public void order_des(int pil[], Ordenamiento four){
int pilar[]=new int [50];
for(int x=0;x<50;x++){
pilar[x]=pil[x];
}
four.cantidad = System.currentTimeMillis();
four.a2++;
four.conta++;
for (int much=0;much<50-1;much++){
for(int Y=0;Y<(50-1)-much;Y++){
if(pilar[Y]<pilar[Y+1]){
four.aux_1=pilar[Y];
pilar[Y]=pilar[Y+1];
pilar[Y+1]=four.aux_1;
four.change++;
}
four.compare++;
}
}
long A=(System.currentTimeMillis()-four.cantidad*1000);
four.b=(int)(A);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+pilar[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+pilar[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+pilar[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+pilar[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+pilar[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
value+=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE LA BURBUJA EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+four.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+four.change);
four.change=0;
four.compare=0;
while(four.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL\\\\\\\\\\\\\\\\n9 MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
four.option =Integer.parseInt(opcio);
switch (four.option) {
case 1:
four.order_as(pil,four);
break;
case 2:
four.order_des(pil,four);
break;
case 3:
four.INSER_AS(pil,four);
break;
case 4:
four.INSER_DES(pil,four);
break;
case 5:
four.Sel_As(pil,four);
break;
case 6:
four.Sel_Des(pil,four);
break;
case 7:
four.Shell_As(pil,four);
break;
case 8:
four.Shell_Des(pil,four);
break;
case 9:
four.Mos_Ef(pil,four);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE INSRCION EN ORDEN DE MENOR A MAYOR*************//
public void INSER_AS(int DE[], Ordenamiento seven){
int CH[]=new int [50];
for(int i=0;i<50;i++){
CH[i]=DE[i];
}
seven.precio = System.currentTimeMillis();
seven.a3++;
seven.conta++;
for (int I=1;I<50;I++){
seven.vary=CH[I];
seven.J=I-1;
while((CH[seven.J]>seven.vary)&(J>=0)){
CH[seven.J+1]=CH[J];
CH[seven.J]=CH[seven.J+1];
J--;
CH[J+1]=seven.vary;
if(seven.J==-1){
seven.J=0;
}
seven.compare++;//para las comparaciones
}
seven.change++;//para los intercambios
}
long D=(System.currentTimeMillis()-seven.precio*1000);
seven.c=(int)(D);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+CH[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+CH[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+CH[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+CH[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+CH[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
value+=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE INSERCION EN ORDEN DE MENOR A MAYOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+seven.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+seven.change);
seven.compare=0;
seven.change=0;
while(seven.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_AS\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5.SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
seven.option =Integer.parseInt(opcio);
switch (seven.option) {
case 1:
seven.order_as(DE,seven);
break;
case 2:
seven.order_des(DE,seven);
break;
case 3:
seven.INSER_AS(DE,seven);
break;
case 4:
seven.INSER_DES(DE,seven);
break;
case 5:
seven.Sel_As(DE,seven);
break;
case 6:
seven.Sel_Des(DE,seven);
break;
case 7:
seven.Shell_As(DE,seven);
break;
case 8:
seven.Shell_Des(DE,seven);
break;
case 9:
seven.Mos_Ef(DE,seven);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE INSERCION EN ORDEN DE MAYOR A MENOR*************//
public void INSER_DES(int G[],Ordenamiento five){
int FA[]=new int [50];
for(int i=0;i<50;i++){
FA[i]=G[i];
}
five.much= System.currentTimeMillis();
five.a4++;
five.conta++;
for (int I=1;I<50;I++){
five.vary=FA[I];
five.J=I-1;
while(FA[five.J]<five.vary){
if(five.J>=0){
FA[five.J+1]=FA[five.J];
J--;
FA[five.J+1]=five.vary;
if(five.J==-1){
five.J=0;
}
five.change++;//para los intercambios
}
}
five.compare++;//para las comparaciones
}
long N=(System.currentTimeMillis()-five.much*1000);
five.d=(int)(N);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+FA[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+FA[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+FA[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+FA[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+FA[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE LA INSERCION EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+five.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+five.change);
/*JOptionPane.showMessageDialog(null,largo);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+five.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+five.change);*/
five.compare=0;
five.change=0;
while(five.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_AS\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
five.option =Integer.parseInt(opcio);
switch (five.option) {
case 1:
five.order_as(G,five);
break;
case 2:
five.order_des(G,five);
break;
case 3:
five.INSER_AS(G,five);
break;
case 4:
five.INSER_DES(G,five);
break;
case 5:
five.Sel_As(G,five);
break;
case 6:
five.Sel_Des(G,five);
break;
case 7:
five.Shell_As(G,five);
break;
case 8:
five.Shell_Des(G,five);
break;
case 9:
five.Mos_Ef(G,five);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE SELECCION DIRECTA EN ORDEN DE MENOR A MAYOR*************//
public void Sel_As(int H[],Ordenamiento X){
int a[]=new int[50];
for(int i=0;i<50;i++){
a[i]=H[i];
}
X.a5++;
X.conta++;
X.meny= System.currentTimeMillis();
for(int i=0;i<a.length-1;i++){
X.menor=a[i];
X.k1=i;
for(int j=i+1;j<a.length;j++){
if(a[j]<menor){
X.menor=a[j];
X.k1=j;
}
X.compare++;
}
a[X.k1]=a[i];
a[i]=X.menor;
X.change++;
}
long Ñ=(System.currentTimeMillis()-X.meny*1000);
X.e=(int)(Ñ);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+a[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+a[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+a[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+a[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+a[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE SELECCION EN ORDEN DE MENOR A MAYOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+X.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+X.change);
/*JOptionPane.showMessageDialog(null,large);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+X.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+X.change);*/
X.compare=0;
X.change=0;
while(X.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_AS\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
X.option =Integer.parseInt(opcio);
switch (X.option) {
case 1:
X.order_as(H,X);
break;
case 2:
X.order_des(H,X);
break;
case 3:
X.INSER_AS(H,X);
break;
case 4:
X.INSER_DES(H,X);
break;
case 5:
X.Sel_As(H,X);
break;
case 6:
X.Sel_Des(H,X);
break;
case 7:
X.Shell_As(H,X);
break;
case 8:
X.Shell_Des(H,X);
break;
case 9:
X.Mos_Ef(H,X);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO DE SELECCION DIRECTA EN ORDEN DE MAYOR A MENOR*************//
public void Sel_Des(int H[],Ordenamiento Y){
int e[]=new int[50];
for(int i=0;i<50;i++){
e[i]=H[i];
}
Y.a6++;
Y.conta++;
Y.numero_1= System.currentTimeMillis();
for(int i=0;i<e.length-1;i++){
Y.menor=e[i];
Y.k1=i;
for(int j=i+1;j<e.length;j++){
if(e[j]>Y.menor){
Y.menor=e[j];
Y.k1=j;
}
Y.compare++;
}
e[Y.k1]=e[i];
e[i]=Y.menor;
Y.change++;
}
long Oso=(System.currentTimeMillis()-Y.numero_1*1000);
Y.f=(int)(Oso);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+e[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+e[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+e[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+e[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+e[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO DE SELECCION EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.change);
/*JOptionPane.showMessageDialog(null,largen);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.change);*/
Y.compare=0;
Y.change=0;
while(Y.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
Y.option =Integer.parseInt(opcio);
switch (Y.option) {
case 1:
Y.order_as(H,Y);
break;
case 2:
Y.order_des(H,Y);
break;
case 3:
Y.INSER_AS(H,Y);
break;
case 4:
Y.INSER_DES(H,Y);
break;
case 5:
Y.Sel_As(H,Y);
break;
case 6:
Y.Sel_Des(H,Y);
break;
case 7:
Y.Shell_As(H,Y);
break;
case 8:
Y.Shell_Des(H,Y);
break;
case 9:
Y.Mos_Ef(H,Y);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//********METODO SHELL EN ORDEN DE MENOR A MAYOR*************//
public void Shell_As(int H[],Ordenamiento Y){
int e[]=new int[50];
for(int i=0;i<50;i++){
e[i]=H[i];
}
Y.a7++;
Y.conta++;
Y.numero_2= System.currentTimeMillis();
Y.salto=e.length/2;
while(Y.salto>0){
for(int i=Y.salto;i<e.length;i++){
Y.ji=i-Y.salto;
while(Y.ji>=0){
Y.ki=Y.ji+Y.salto;
if(e[Y.ji]<=e[Y.ki]){
Y.ji--;
Y.compare++;
}
else{
int auxi=e[Y.ji];
e[Y.ji]=e[Y.ki];
e[Y.ki]=auxi;
Y.ji-=Y.salto;
Y.change++;
}
}
}
Y.salto/=2;
}
long Ola=(System.currentTimeMillis()-Y.numero_2*1000);
Y.g=(int)(Ola);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+e[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+e[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+e[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+e[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+e[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO SHELL EN ORDEN DE MENOR A MAYOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.change);
/* JOptionPane.showMessageDialog(null,largen);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.change);*/
Y.compare=0;
Y.change=0;
while(Y.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. LEAVE\\\\\\\\\\\\\\\");
Y.option =Integer.parseInt(opcio);
switch (Y.option) {
case 1:
Y.order_as(H,Y);
break;
case 2:
Y.order_des(H,Y);
break;
case 3:
Y.INSER_AS(H,Y);
break;
case 4:
Y.INSER_DES(H,Y);
break;
case 5:
Y.Sel_As(H,Y);
break;
case 6:
Y.Sel_Des(H,Y);
break;
case 7:
Y.Shell_As(H,Y);
break;
case 8:
Y.Shell_Des(H,Y);
break;
case 9:
Y.Mos_Ef(H,Y);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//******** METODO SHELL EN ORDEN DE MAYOR A MENOR *************//
public void Shell_Des(int H[],Ordenamiento Y){
int e[]=new int[50];
for(int i=0;i<50;i++){
e[i]=H[i];
}
Y.a8++;
Y.conta++;
Y.numero_3= System.currentTimeMillis();
Y.salto=e.length/2;
while(Y.salto>0){
for(int i=Y.salto;i<e.length;i++){
Y.ji=i-Y.salto;
while(Y.ji>=0){
Y.ki=Y.ji+Y.salto;
if(e[Y.ji]>=e[Y.ki]){
Y.ji--;
Y.compare++;
}
else{
int auxil=e[Y.ji];
e[Y.ji]=e[Y.ki];
e[Y.ki]=auxil;
Y.ji-=Y.salto;
Y.change++;
}
}
}
Y.salto/=2;
}
long Oyo=(System.currentTimeMillis()-Y.numero_3*1000);
Y.h=(int)(Oyo);
String value=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
for(int B=0;B<10;B++){
value=value+e[B]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(B==9){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int x=B+1;x<20;x++){
value=value+e[x]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(x==19){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int y=x+1;y<30;y++){
value=value+e[y]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(y==29){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int i=y+1;i<40;i++){
value=value+e[i]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
if(i==39){
value=value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
for(int q=i+1;q<50;q++){
value=value+e[q]+\\\\\\\\\\\\\\\"||\\\\\\\\\\\\\\\";
}
}
}
}
}
}
}
}
}
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"METODO SHELL EN ORDEN DE MAYOR A MENOR \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+value+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE COMPARACIONES\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.compare+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nNUMERO DE INTERCAMBIOS\\\\\\\\\\\\\\\\t \\\\\\\\\\\\\\\"+Y.change);
/*JOptionPane.showMessageDialog(null,largen);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"COMPARE THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.compare);
JOptionPane.showMessageDialog(null,\\\\\\\\\\\\\\\"CHANGES THE NUMBER\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\"+Y.change);*/
Y.compare=0;
Y.change=0;
while(Y.option!=10){
String opcio = JOptionPane.showInputDialog
(\\\\\\\\\\\\\\\"MENU PRINCIPAL\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n1. BURBUJA_AS\\\\\\\\\\\\\\\\n2. BURBUJA_DES\\\\\\\\\\\\\\\\n3. INSERCION_AS\\\\\\\\\\\\\\\\n4. INSERCION_DES\\\\\\\\\\\\\\\\n5. SELECCION_AS\\\\\\\\\\\\\\\\n6. SELECCION_DES\\\\\\\\\\\\\\\\n7. SHELL_AS\\\\\\\\\\\\\\\\n8. SHELL_DES\\\\\\\\\\\\\\\\n9. MOSTRAR EFICIENCIA\\\\\\\\\\\\\\\\n10. SALIR\\\\\\\\\\\\\\\");
Y.option =Integer.parseInt(opcio);
switch (Y.option) {
case 1:
Y.order_as(H,Y);
break;
case 2:
Y.order_des(H,Y);
break;
case 3:
Y.INSER_AS(H,Y);
break;
case 4:
Y.INSER_DES(H,Y);
break;
case 5:
Y.Sel_As(H,Y);
break;
case 6:
Y.Sel_Des(H,Y);
break;
case 7:
Y.Shell_As(H,Y);
break;
case 8:
Y.Shell_Des(H,Y);
break;
case 9:
Y.Mos_Ef(H,Y);
break;
case 10:
System.exit(0);
break;
default:
JOptionPane.showInputDialog(null,\\\\\\\\\\\\\\\"OPTION NOT VALID\\\\\\\\\\\\\\\");
}
}
}
//** METODO QUE MIESTRA EL TIEMPO DE EJECUCION DE LOS METODOS UTILIZADOS **//
public void Mos_Ef(int D[],Ordenamiento luc){
int v[]=new int [8];
String evaluar=\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\";
int cont=-1;
int aux=0;
evaluar+=\\\\\\\\\\\\\\\"METODO \\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"TIEMPO DE EJECUCION\\\\\\\\\\\\\\\"+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
while (luc.conta!=0){
if(luc.a1==1){
luc.a1--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Burbuja_1 \\\\\\\\\\\\\\\"+luc.a+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.a;
}
if(luc.a2==1){
luc.a2--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Burbuja_2 \\\\\\\\\\\\\\\"+luc.b+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.b;
}
if(luc.a3==1){
luc.a3--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Insercion_1 \\\\\\\\\\\\\\\"+luc.c+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.c;
}
if(luc.a4==1){
luc.a4--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Insercion_2 \\\\\\\\\\\\\\\"+luc.d+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.d;
}
if(luc.a5==1){
luc.a5--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Seleccion_1 \\\\\\\\\\\\\\\"+luc.e+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.e;
}
if(luc.a6==1){
luc.a6--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Seleccion_2 \\\\\\\\\\\\\\\"+luc.f+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.f;
}
if(luc.a7==1){
luc.a7--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Shell_1 \\\\\\\\\\\\\\\"+luc.g+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.g;
}
if(luc.a8==1){
luc.a8--;
luc.conta--;
evaluar+=\\\\\\\\\\\\\\\"Shell_2 \\\\\\\\\\\\\\\"+luc.h+\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\";
cont++;
v[cont]=luc.h;
}
}
int X=0;
aux=v[X];
while(X<cont){
if(aux<v[X+1]){
X++;
}
else{
X++;
aux=v[X];
}
}
String nombre=\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\";
if(luc.a==aux){
nombre=\\\\\\\\\\\\\\\"Burbuja_1\\\\\\\\\\\\\\\";
}
if(luc.b==aux){
nombre=\\\\\\\\\\\\\\\"Burbuja_2\\\\\\\\\\\\\\\";
}
if(luc.c==aux){
nombre=\\\\\\\\\\\\\\\"Insercion_1\\\\\\\\\\\\\\\";
}
if(luc.d==aux){
nombre=\\\\\\\\\\\\\\\"Insercion_2\\\\\\\\\\\\\\\";
}
if(luc.e==aux){
nombre=\\\\\\\\\\\\\\\"Seleccion_1\\\\\\\\\\\\\\\";
}
if(luc.f==aux){
nombre=\\\\\\\\\\\\\\\"Seleccion_2\\\\\\\\\\\\\\\";
}
if(luc.g==aux){
nombre=\\\\\\\\\\\\\\\"Shell_1\\\\\\\\\\\\\\\";
}
if(luc.h==aux){
nombre=\\\\\\\\\\\\\\\"Shell_2\\\\\\\\\\\\\\\";
}
JOptionPane.showMessageDialog(null,evaluar+\\\\\\\\\\\\\\\" \\\\\\\\\\\\\\\\nMETODO CON MENOS TIEMPO DE EJECUCION \\\\\\\\\\\\\\\"+nombre);
System.exit(0);
}
}
//****************** CLASE PRINCIPAL*********************//
public class Implement_Order{
public static void main(String [] args){
Ordenamiento young=new Ordenamiento();
int copy[]; copy=new int[50];
young.NumeroAl(copy,young);
System.exit(0);
}
}