Está en la página 1de 6

METODO DE ORDENAMIENTO BARAJA (INSERCCION DIRECTA)

public class Baraja {


public int[] Baraja(int[] data) {
int len = data.length;
int key = 0;
int i = 0;
for (int j = 1; j < len; j++) {
key = data[j];
i = j - 1;
while (i >= 0 && data[i] > key) {
data[i + 1] = data[i];
i = i - 1;
data[i + 1] = key;
}
}
return data;
}
}

METODO DE ORDENAMIENTO BARAJA (INSERCCION DIRECTA)


public class Main {
public static void main(String[] args) {
Baraja order = new Baraja();
int[] array;
Scanner entrada = new Scanner(System.in);
System.out.println("Ingrese tamao del nuevo arreglo");
int tamao = entrada.nextInt();
array = new int[tamao];
for (int i = 0; i < tamao; i++) {
System.out.println("Ingrese valor para posicin " + i);
array[i] = entrada.nextInt();
}
int[] arrayInt = new int[array.length];
for (int i = 0; i < array.length; i++) {
arrayInt[i] = (int) array[i];
}
order.Baraja (arrayInt);
int[] arrayChOrd = new int[array.length];
System.out.println("Ascendentemente");
for(int i = 0; i<arrayInt.length;i++ ){
arrayChOrd[i]=(char)arrayInt[i];
System.out.println(arrayChOrd[i]);
}
System.out.println("descendentemente");
for(int i =arrayInt.length-1;i>0;i-- ){
arrayChOrd[i]=(char)arrayInt[i];

System.out.println(arrayChOrd[i]);
}
}
}

METODO DE ORDENAMIENTO BURBUJA


public class Burbuja {
public int[] bubbleSort(int[] data) {
int lenD = data.length;
int tmp = 0;
for (int i = 0; i < lenD; i++) {
for (int j = (lenD - 1); j >= (i + 1); j--) {
if (data[j] < data[j - 1]) {
tmp = data[j];
data[j] = data[j - 1];
data[j - 1] = tmp;
}
}
}
return data;
}
}

METODO DE ORDENAMIENTO BURBUJA


public class Main {
public static void main(String[] args) {
Burbuja order = new Burbuja();
int[] array;
Scanner entrada = new Scanner(System.in);
System.out.println("Ingrese tamao del nuevo arreglo");
int tamao = entrada.nextInt();
array = new int[tamao];
for (int i = 0; i < tamao; i++) {
System.out.println("Ingrese valor para posicin " + i);
array[i] = entrada.nextInt();
}
int[] arrayInt = new int[array.length];
for (int i = 0; i < array.length; i++) {
arrayInt[i] = (int) array[i];
}
order.bubbleSort(arrayInt);
int[] arrayChOrd = new int[array.length];
System.out.println(" Ascendentemente ");
for(int i = 0; i<arrayInt.length;i++ ){
arrayChOrd[i]=(char)arrayInt[i];
System.out.println(arrayChOrd[i]);
}
System.out.println(" Descendentemente ");

for(int i =arrayInt.length-1;i>0;i-- ){

arrayChOrd[i]=(char)arrayInt[i];
System.out.println(arrayChOrd[i]);
}
}
}

También podría gustarte