-
Notifications
You must be signed in to change notification settings - Fork 13
Ejercicios Arrays #8
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
83732bd
a2e556e
99c387c
4cce78e
71008ee
9644d52
cda2345
e1224ea
5f13e95
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.
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.
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -5,10 +5,36 @@ | |
| public class UnidimensionalImpl implements Unidimensional { | ||
| @Override | ||
| public void ordenamiento(int[] arr) { | ||
| boolean flag=false; | ||
| while(!flag){ | ||
| flag=true; | ||
| for(int i=0;i<arr.length-1;i++){ | ||
| if(arr[i]>arr[i+1]){ | ||
| int a=arr[i]; | ||
| int b=arr[i+1]; | ||
| arr[i+1]=a; | ||
| arr[i]=b; | ||
| flag=false; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| @Override | ||
| public int[] ordenamientoReversa(int[] arr) { | ||
| return null; | ||
| boolean flag=false; | ||
| while(!flag){ | ||
| flag=true; | ||
| for(int i=0;i<arr.length-1;i++){ | ||
| if(arr[i]<arr[i+1]){ | ||
|
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. Lo mismo que el comentario anterior |
||
| int a=arr[i]; | ||
| int b=arr[i+1]; | ||
| arr[i+1]=a; | ||
| arr[i]=b; | ||
| flag=false; | ||
| } | ||
| } | ||
| } | ||
| return arr; | ||
| } | ||
| } | ||
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()