-
Notifications
You must be signed in to change notification settings - Fork 13
Feature/implementation #2
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
| public void ordenamiento(int[] arr) { | ||
| int len = arr.length, temp; | ||
|
|
||
| for (int i = 0; i < len; i++) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
La logica es correcta, pero a veces puedes usar herramientas existentes como el Arrays.sort(), este hace un ordenamiento ascedente
| return null; | ||
| int len = arr.length, temp; | ||
|
|
||
| for (int i = 0; i < len; i++) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Como se menciono en el comentario anterior, pues hacer uso de herramientas existentes de Java, puedes usar el metodo sobrecargado de Arrays.sort donde puede poner un comparator en los parametros... Arrays.sort(arr, Comparator.reverseOrder());
DynamicArrayList.java
# Conflicts: # .gitignore
He agregado las implementaciones de cada método en las clases Unidimensional y Multidimensional. Los tests pasan correctamente, también he modificado la versión de Gradle ya que estoy utilizando Java 17.