From f84a6eb5578cd19e05795b1db58eed80759e994d Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 9 Sep 2024 19:03:32 -0600 Subject: [PATCH 01/11] Practica 1 2024 --- ago-dic-2024/practica.java | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 ago-dic-2024/practica.java diff --git a/ago-dic-2024/practica.java b/ago-dic-2024/practica.java new file mode 100644 index 000000000..e69de29bb From 357f3363e4f86341c77fca936e940eb0ab382911 Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 9 Sep 2024 19:13:18 -0600 Subject: [PATCH 02/11] practica 1 --- ago-dic-2024/practicas/{practica_1 => Alondra Tristan}/README.md | 0 .../{ => practicas/Alondra Tristan/practica 1}/practica.java | 0 2 files changed, 0 insertions(+), 0 deletions(-) rename ago-dic-2024/practicas/{practica_1 => Alondra Tristan}/README.md (100%) rename ago-dic-2024/{ => practicas/Alondra Tristan/practica 1}/practica.java (100%) diff --git a/ago-dic-2024/practicas/practica_1/README.md b/ago-dic-2024/practicas/Alondra Tristan/README.md similarity index 100% rename from ago-dic-2024/practicas/practica_1/README.md rename to ago-dic-2024/practicas/Alondra Tristan/README.md diff --git a/ago-dic-2024/practica.java b/ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java similarity index 100% rename from ago-dic-2024/practica.java rename to ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java From f3d767ef196b55e3ca49ec0da4c08e019a593d00 Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 9 Sep 2024 19:26:27 -0600 Subject: [PATCH 03/11] practica_1 --- .../Alondra Tristan/practica 1/practica.java | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java b/ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java index e69de29bb..15050324d 100644 --- a/ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java +++ b/ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java @@ -0,0 +1,14 @@ +import java.util.Scanner; + +public class SumaDeEnteros { + public static void main(String[] args) { + + Scanner scanner = new Scanner(System.in); + + int a = scanner.nextInt(); + int b = scanner.nextInt(); + + + System.out.println(a + b); + } +} From 11061cfb47b83a49ec9362e4de9e3815871c142f Mon Sep 17 00:00:00 2001 From: alondra Date: Fri, 20 Sep 2024 17:18:44 -0600 Subject: [PATCH 04/11] Segunda Practica --- .../{practica 1 => Practicas}/practica.java | 0 .../Alondra Tristan/Practicas/practica_2.java | 49 +++++++++++++++++++ 2 files changed, 49 insertions(+) rename ago-dic-2024/practicas/Alondra Tristan/{practica 1 => Practicas}/practica.java (100%) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Practicas/practica_2.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java b/ago-dic-2024/practicas/Alondra Tristan/Practicas/practica.java similarity index 100% rename from ago-dic-2024/practicas/Alondra Tristan/practica 1/practica.java rename to ago-dic-2024/practicas/Alondra Tristan/Practicas/practica.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practicas/practica_2.java b/ago-dic-2024/practicas/Alondra Tristan/Practicas/practica_2.java new file mode 100644 index 000000000..2bc28315d --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Practicas/practica_2.java @@ -0,0 +1,49 @@ +package practicas; +import java.util.Scanner; + +public class practica_2 { + + public static void main(String[] args) { + + int n= 10; + int m = 5; + + System.out.println(n + " " + m); + + int ni[] = {1, 3, 1, 10, 8, 4, 5, 6, 9, 5}; + + for (int i = 0; i < ni.length; i++) { + System.out.print(ni[i] + " "); + } + + System.out.println(); + + //Insertion sort + for (int i = 1; i < ni.length; i++) { + int elem_actual = ni[i]; + int j = i - 1; + + while (j >= 0 && ni[j] > elem_actual) { + ni[j + 1] = ni[j]; + j--; + } + ni[j + 1] = elem_actual; + } + + int tiempo = 0; + int problemasResueltos = 0; + + for (int i = 0; i < n; i++) { + if (tiempo + ni[i] <= m) { + tiempo += ni[i]; + problemasResueltos++; + } else { + break; + } + } + + System.out.print(problemasResueltos); + + }//end main + +}//end class \ No newline at end of file From f9ea60821d8c358068ade8464cc8a95a1cf25484 Mon Sep 17 00:00:00 2001 From: alondra Date: Fri, 20 Sep 2024 17:23:55 -0600 Subject: [PATCH 05/11] Practica 2 --- .../Alondra Tristan/{Practicas => Practica 1}/practica.java | 0 .../Alondra Tristan/{Practicas => Practica 2}/practica_2.java | 0 2 files changed, 0 insertions(+), 0 deletions(-) rename ago-dic-2024/practicas/Alondra Tristan/{Practicas => Practica 1}/practica.java (100%) rename ago-dic-2024/practicas/Alondra Tristan/{Practicas => Practica 2}/practica_2.java (100%) diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practicas/practica.java b/ago-dic-2024/practicas/Alondra Tristan/Practica 1/practica.java similarity index 100% rename from ago-dic-2024/practicas/Alondra Tristan/Practicas/practica.java rename to ago-dic-2024/practicas/Alondra Tristan/Practica 1/practica.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practicas/practica_2.java b/ago-dic-2024/practicas/Alondra Tristan/Practica 2/practica_2.java similarity index 100% rename from ago-dic-2024/practicas/Alondra Tristan/Practicas/practica_2.java rename to ago-dic-2024/practicas/Alondra Tristan/Practica 2/practica_2.java From 7f844dee498efd19026745f0a982bd79a7d0405c Mon Sep 17 00:00:00 2001 From: alondra Date: Fri, 4 Oct 2024 17:16:16 -0600 Subject: [PATCH 06/11] Practica 3 --- .../Alondra Tristan/Practica 3/pokemones.java | 38 +++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Practica 3/pokemones.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practica 3/pokemones.java b/ago-dic-2024/practicas/Alondra Tristan/Practica 3/pokemones.java new file mode 100644 index 000000000..5f2e1f3be --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Practica 3/pokemones.java @@ -0,0 +1,38 @@ +import java.util.Scanner; + +public class pokemones { + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + + System.out.print("Numero de pokemones: "); + int n = scanner.nextInt(); + int[] pokemones = new int[n]; + + System.out.print("Pokemones: "); + for (int i = 0; i < n; i++) { + pokemones[i] = scanner.nextInt(); + } + + //Bubble sort + for (int i = 0; i < n - 1; i++) { + for (int j = 0; j < n - 1 - i; j++) { + if (pokemones[j] < pokemones[j + 1]) { + int temp = pokemones[j]; + pokemones[j] = pokemones[j + 1]; + pokemones[j + 1] = temp; + } + } + } + + for (int i = 0; i < n; i++) { + System.out.print(pokemones[i]); + if (i < n - 1) { + System.out.print(" "); + } + } + + + }//end main + +}//end class \ No newline at end of file From 82e242de766d9b785ef6bf510f390a91745f060d Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 7 Oct 2024 21:18:03 -0600 Subject: [PATCH 07/11] Examen practico --- .../Parcial 1/ejercicio_1.java | 33 ++++++++++++++++ .../Parcial 1/ejercicio_2.java | 39 +++++++++++++++++++ 2 files changed, 72 insertions(+) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_1.java create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_2.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_1.java b/ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_1.java new file mode 100644 index 000000000..652829c6d --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_1.java @@ -0,0 +1,33 @@ +import java.util.Scanner; + +public class ejercicio_1 { + + public static void main(String[] args) { + Scanner s = new Scanner(System.in); + + System.out.print("Num medicinas: "); + int n = s.nextInt(); + String[] medicinas = new String[n]; + + System.out.print("Medicinas: "); + for (int i = 0; i < n; i++) { + medicinas[i] = s.toString(); + } + + //Insertion sort + for (int i = 1; i < medicinas.length; i++) { + String elem_actual = medicinas[i]; + int j = i - 1; + while (j >= 0 && medicinas[j] > elem_actual) { + medicinas[j + 1] = medicinas[j]; + j--; + } + medicinas[j + 1] = elem_actual; + } + + + + + } + +} \ No newline at end of file diff --git a/ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_2.java b/ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_2.java new file mode 100644 index 000000000..10acedcaa --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Parcial 1/ejercicio_2.java @@ -0,0 +1,39 @@ +import java.util.Scanner; + +public class ejercicio_2 { + + public static void main(String[] args) { + Scanner s = new Scanner(System.in); + + System.out.print("Num medicinas: "); + int n = s.nextInt(); + String[] medicinas = new String[n]; + int[] pas = new int[n]; + + System.out.print("Medicinas y pastillas sobrantes: "); + for (int i = 0; i < n; i++) { + medicinas[i] = s.toString(); + pas[i]=s.nextInt(); + } + + //Insertion sort + for (int i = 1; i < pas.length; i++) { + int elem_actual = pas[i]; + int j = i - 1; + while (j >= 0 && pas[j] < elem_actual) { + pas[j + 1] = pas[j]; + j--; + } + pas[j + 1] = elem_actual; + } + + for (int i = 0; i < n; i++) { + System.out.print(medicinas[i]); + if (i < n - 1) { + System.out.print(" "); + } + } + + }//end main + +}//end class \ No newline at end of file From 1075bbb1e47540f5975f300dde602819bb464dfc Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 11 Nov 2024 17:15:51 -0600 Subject: [PATCH 08/11] Practica 4 --- .../Practica 4/OrdenarPalabrasMergeSort.java | 86 +++++++++++++++++++ 1 file changed, 86 insertions(+) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Practica 4/OrdenarPalabrasMergeSort.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practica 4/OrdenarPalabrasMergeSort.java b/ago-dic-2024/practicas/Alondra Tristan/Practica 4/OrdenarPalabrasMergeSort.java new file mode 100644 index 000000000..f761f9235 --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Practica 4/OrdenarPalabrasMergeSort.java @@ -0,0 +1,86 @@ +package practicas; +import java.util.Scanner; + +public class OrdenarPalabrasMergeSort { + + public static void mergeSort(String[] arr, int left, int right) { + if (left < right) { + int middle = left + (right - left) / 2; + + // Ordenar la primera y segunda mitad + mergeSort(arr, left, middle); + mergeSort(arr, middle + 1, right); + + // Combinar las mitades ordenadas + merge(arr, left, middle, right); + } + } + + public static void merge(String[] arr, int left, int middle, int right) { + // Tamaños de los subarrays temporales + int n1 = middle - left + 1; + int n2 = right - middle; + + // Crear arrays temporales + String[] leftArray = new String[n1]; + String[] rightArray = new String[n2]; + + // Copiar los datos a los arrays temporales + for (int i = 0; i < n1; ++i) + leftArray[i] = arr[left + i]; + for (int j = 0; j < n2; ++j) + rightArray[j] = arr[middle + 1 + j]; + + // Combinar los arrays temporales + + int i = 0, j = 0; + int k = left; + while (i < n1 && j < n2) { + if (leftArray[i].compareTo(rightArray[j]) <= 0) { + arr[k] = leftArray[i]; + i++; + } else { + arr[k] = rightArray[j]; + j++; + } + k++; + } + + // Copiar los elementos restantes de leftArray, si quedan + while (i < n1) { + arr[k] = leftArray[i]; + i++; + k++; + } + + // Copiar los elementos restantes de rightArray, si quedan + while (j < n2) { + arr[k] = rightArray[j]; + j++; + k++; + } + } + + public static void main(String[] args) { + + Scanner scanner = new Scanner(System.in); + + System.out.print("Introduzca el numero y las palabras: "); + // Leer el número de palabras + int n = Integer.parseInt(scanner.nextLine()); + + // Leer las palabras y almacenarlas en un array + String[] palabras = scanner.nextLine().split(" "); + + // Ordenar las palabras usando Merge Sort + mergeSort(palabras, 0, palabras.length - 1); + + System.out.print("Palabras ordenadas: "); + // Imprimir las palabras ordenadas + System.out.println(String.join(" ", palabras)); + + scanner.close(); + + } + +} \ No newline at end of file From c3e904b497471a2460776189e5b238324f3be90a Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 11 Nov 2024 17:19:49 -0600 Subject: [PATCH 09/11] Practica 5 --- .../Practica 5/OrdenarLibrosMergeSort.java | 99 +++++++++++++++++++ 1 file changed, 99 insertions(+) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Practica 5/OrdenarLibrosMergeSort.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practica 5/OrdenarLibrosMergeSort.java b/ago-dic-2024/practicas/Alondra Tristan/Practica 5/OrdenarLibrosMergeSort.java new file mode 100644 index 000000000..e19d129f0 --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Practica 5/OrdenarLibrosMergeSort.java @@ -0,0 +1,99 @@ +import java.util.Scanner; + +class Libro { + String nombre; + int paginas; + + Libro(String nombre, int paginas) { + this.nombre = nombre; + this.paginas = paginas; + } +} +public class OrdenarLibrosMergeSort { + + public static void mergeSort(Libro[] arr, int left, int right) { + if (left < right) { + int middle = left + (right - left) / 2; + + // Ordenar la primera y segunda mitad + mergeSort(arr, left, middle); + mergeSort(arr, middle + 1, right); + + // Combinar las mitades ordenadas + merge(arr, left, middle, right); + } + } + + public static void merge(Libro[] arr, int left, int middle, int right) { + // Tamaños de los subarrays temporales + int n1 = middle - left + 1; + int n2 = right - middle; + + // Crear arrays temporales + Libro[] leftArray = new Libro[n1]; + Libro[] rightArray = new Libro[n2]; + + // Copiar los datos a los arrays temporales + for (int i = 0; i < n1; ++i) + leftArray[i] = arr[left + i]; + for (int j = 0; j < n2; ++j) + rightArray[j] = arr[middle + 1 + j]; + + // Combinar los arrays temporales + int i = 0, j = 0; + int k = left; + while (i < n1 && j < n2) { + if (leftArray[i].paginas <= rightArray[j].paginas) { + arr[k] = leftArray[i]; + i++; + } else { + arr[k] = rightArray[j]; + j++; + } + k++; + } + + // Copiar los elementos restantes de leftArray, si quedan + while (i < n1) { + arr[k] = leftArray[i]; + i++; + k++; + } + + // Copiar los elementos restantes de rightArray, si quedan + while (j < n2) { + arr[k] = rightArray[j]; + j++; + k++; + } + } + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + + // Leer el número de libros + System.out.print("Introduce el num de libros, titula y páginas: "); + int n = Integer.parseInt(scanner.nextLine()); + Libro[] libros = new Libro[n]; + + // Leer los libros y almacenarlos en un array + for (int i = 0; i < n; i++) { + String[] entrada = scanner.nextLine().split(" "); + String nombre = entrada[0]; + int paginas = Integer.parseInt(entrada[1]); + libros[i] = new Libro(nombre, paginas); + } + + // Ordenar los libros usando Merge Sort + mergeSort(libros, 0, n - 1); + + // Imprimir los nombres de los libros ordenados + for (Libro libro : libros) { + System.out.print(libro.nombre + " "); + } + + scanner.close(); + + }//end main + +}//end class \ No newline at end of file From df85f5688466668be8b2496f15d2fc58538bb3ce Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 11 Nov 2024 17:21:25 -0600 Subject: [PATCH 10/11] Practica 6 --- .../Practica 6/OrdenarColoresQuickSort.java | 85 +++++++++++++++++++ 1 file changed, 85 insertions(+) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Practica 6/OrdenarColoresQuickSort.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Practica 6/OrdenarColoresQuickSort.java b/ago-dic-2024/practicas/Alondra Tristan/Practica 6/OrdenarColoresQuickSort.java new file mode 100644 index 000000000..1a7c3fcf3 --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Practica 6/OrdenarColoresQuickSort.java @@ -0,0 +1,85 @@ +import java.util.Scanner; + +public class OrdenarColoresQuickSort { + /** + * Método para ordenar un array usando Quick Sort. + * arr El array de enteros a ordenar. + * low El índice inicial del subarray. + * high El índice final del subarray. + */ + public static void quickSort(int[] arr, int low, int high) { + if (low < high) { + // pi es el índice de partición, arr[pi] está en la posición correcta + int pi = partition(arr, low, high); + + // Ordenar los elementos antes y después de la partición + quickSort(arr, low, pi - 1); // Subarray izquierdo + quickSort(arr, pi + 1, high); // Subarray derecho + } + } + + /** + * Método para colocar el pivot en la posición correcta y organizar el array + * de manera que los elementos menores estén a la izquierda y los mayores a la derecha. + * arr El array de enteros. + * low El índice inicial del subarray. + * high El índice final del subarray (pivot). + * La posición final del pivot. + */ + public static int partition(int[] arr, int low, int high) { + // El pivot se elige como el último elemento del subarray + int pivot = arr[high]; + int i = (low - 1); // Índice del elemento más pequeño + + // Recorrer el array y reorganizar los elementos en relación con el pivot + for (int j = low; j < high; j++) { + // Si el elemento actual es menor o igual al pivot + if (arr[j] <= pivot) { + i++; + // Intercambiar arr[i] con arr[j] + int temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; + } + } + + // Intercambiar el pivot (arr[high]) con el elemento en arr[i+1] + int temp = arr[i + 1]; + arr[i + 1] = arr[high]; + arr[high] = temp; + + // Devolver el índice del pivot + return i + 1; + } + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + + // Leer el número de colores + System.out.print("Numero de colores e ID de colores: "); + int n = Integer.parseInt(scanner.nextLine()); + + // Leer los ids de los colores como una línea de texto y dividirla en partes + String[] entrada = scanner.nextLine().split(" "); + int[] ids = new int[n]; + + // Convertir los ids de tipo String a enteros y almacenarlos en un array + for (int i = 0; i < n; i++) { + ids[i] = Integer.parseInt(entrada[i]); + } + + // Ordenar los ids usando Quick Sort + quickSort(ids, 0, n - 1); + + System.out.print("Arreglo Ordenado: "); + // Imprimir los ids ordenados en una sola línea + for (int i = 0; i < n; i++) { + // Imprimir los números con un espacio, sin agregar un espacio al final + System.out.print(ids[i] + (i < n - 1 ? " " : "")); + } + + scanner.close(); + + } + +} From 63028ec41f02ecbcdbf5dd61bbf7a32d2901153f Mon Sep 17 00:00:00 2001 From: alondra Date: Mon, 11 Nov 2024 21:22:28 -0600 Subject: [PATCH 11/11] Ejercicios del examen --- .../Parcial 2/ejercicio_1.java | 70 +++++++++++++++++++ .../Parcial 2/ejercicio_2.java | 55 +++++++++++++++ 2 files changed, 125 insertions(+) create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_1.java create mode 100644 ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_2.java diff --git a/ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_1.java b/ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_1.java new file mode 100644 index 000000000..f3c9256b5 --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_1.java @@ -0,0 +1,70 @@ +import java.util.Scanner; + +public class OrdenarColores { + class Color { + public String nombre; + public int numero; + + Color(String nombre, int numero) { + this.nombre = nombre; + this.numero = numero; + } + } + + public static void quickSort(Color[] arr, int low, int high) { + if (low < high) { + int pi = partition(arr, low, high); + + // Ordenar los elementos antes y después de la partición + quickSort(arr, low, pi - 1); + quickSort(arr, pi + 1, high); + } + } + + public static int partition(Color[] arr, int low, int high) { + Color pivot = arr[high]; + int i = (low - 1); + + for (int j = low; j < high; j++) { + if (arr[j] <= pivot) { + i++; + Color temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; + } + } + + Color temp = arr[i + 1]; + arr[i + 1] = arr[high]; + arr[high] = temp; + + return i + 1; + } + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + + System.out.print("Introduce el color y el num: "); + int n = Integer.parseInt(scanner.nextLine()); + Color[] colores = new Color[n]; + + // Leer los colores y almacenarlos en un arreglo + for (int i = 0; i < n; i++) { + String[] entrada = scanner.nextLine().split(" "); + String nombre = entrada[0]; + int numero = Integer.parseInt(entrada[1]); + colores[i] = new Color(nombre, numero); + } + + // Ordenar los numeros usando Quick Sort + quickSort(colores, 0, n - 1); + + for (Color color : colores) { + System.out.print(color.nombre + " "); + } + + scanner.close(); + + }//end main + +}//end class \ No newline at end of file diff --git a/ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_2.java b/ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_2.java new file mode 100644 index 000000000..b4f494da5 --- /dev/null +++ b/ago-dic-2024/practicas/Alondra Tristan/Parcial 2/ejercicio_2.java @@ -0,0 +1,55 @@ +import java.util.Scanner; + +public class OrdenarNumerosCountingSort { + class CountingSort { + void countSort(int array[], int size) { + int[] output = new int[size + 1]; + + int max = array[0]; + for (int i = 1; i < size; i++) { + if (array[i] > max) + max = array[i]; + } + int[] count = new int[max + 1]; + + for (int i = 0; i < max; ++i) { + count[i] = 0; + } + + + for (int i = 0; i < size; i++) { + count[array[i]]++; + } + + for (int i = 1; i <= max; i++) { + count[i] += count[i - 1]; + } + + for (int i = size - 1; i >= 0; i--) { + output[count[array[i]] - 1] = array[i]; + count[array[i]]--; + } + + + for (int i = 0; i < size; i++) { + array[i] = output[i]; + } + } + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + + System.out.print("Numeros que Juan quiere ordenar: "); + int n = scanner.nextInt(); + int[] CountingSort = new int[n]; + + System.out.print("Numeros ordenados: "); + for (int i = 0; i < n; i++) { + CountingSort[i] = scanner.nextInt(); + } + + + }//end main + + }//end class counting sort +}//end class \ No newline at end of file