Skip to content

Conversation

@brandonhxrr
Copy link

No description provided.

public void ordenamiento(int[] arr) {
for (int j = 0; j < arr.length; j++){
for (int i = 0; i < arr.length - 1; i++){
if( arr[i] > arr[i + 1]) {
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Puedes ver si hay una mejora de ordenamiento con respecto a tu actual solucion, hay algoritmos mas rapidos que puedes implementar incluso Arrays.sort()

public int[] ordenamientoReversa(int[] arr) {
return null;
for (int j = 0; j < arr.length; j++){
for (int i = 0; i < arr.length - 1; i++){
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

los mismo del comentario anterior

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants