-
Notifications
You must be signed in to change notification settings - Fork 13
Ejercicio finalizado #11
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?
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
This file was deleted.
This file was deleted.
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -5,10 +5,27 @@ | |
| public class UnidimensionalImpl implements Unidimensional { | ||
| @Override | ||
| public void ordenamiento(int[] arr) { | ||
| int aux; | ||
| for (int i=0; i< arr.length-1; i++){ | ||
| for (int j=0; j<arr.length-1; j++){ | ||
| if (arr[j]>arr[j+1]){ | ||
| aux = arr[j]; | ||
| arr[j] = arr[j+1]; | ||
| arr[j+1] = aux; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| @Override | ||
| public int[] ordenamientoReversa(int[] arr) { | ||
| return null; | ||
| int arrInvertido[] = arr; | ||
| int aux; | ||
| for (int i=0; i<arrInvertido.length/2; i++){ | ||
|
Owner
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Este codigo tambien puede tener una mejora. |
||
| aux = arrInvertido[i]; | ||
| arrInvertido[i] = arrInvertido[arrInvertido.length - 1 - i]; | ||
| arrInvertido[arrInvertido.length - 1 - i] = aux; | ||
| } | ||
| return arrInvertido; | ||
| } | ||
| } | ||
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.
Puedes ver si hay una mejora de ordenamiento con respecto a tu actual solucion, hay algoritmos mas rapidos que puedes implementar incluso Arrays.sort()