-
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
Open
rValeM
wants to merge
9
commits into
chrisom79:main
Choose a base branch
from
rValeM:main
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from 2 commits
Commits
Show all changes
9 commits
Select commit
Hold shift + click to select a range
83732bd
Update MultidimensionalImpl.java
rValeM a2e556e
Update UnidimensionalImpl.java
rValeM 99c387c
Merge branch 'chrisom79:main' into main
rValeM 4cce78e
Merge branch 'chrisom79:main' into main
rValeM 71008ee
Merge branch 'chrisom79:main' into main
rValeM 9644d52
ejercicio stream
rValeM cda2345
ejercicio stream
rValeM e1224ea
Ejercicio stream ciudades.
rValeM 5f13e95
Ejercicio stream ciudades.
rValeM File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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; | ||
| } | ||
| } | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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()