Skip to content
Open
Show file tree
Hide file tree
Changes from 2 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 11 additions & 1 deletion src/main/java/com/oracle/arrays/impl/MultidimensionalImpl.java
Original file line number Diff line number Diff line change
Expand Up @@ -6,11 +6,21 @@
public class MultidimensionalImpl implements Multidimensional {
@Override
public Posicion getPosition(String[][] datos, String dato) {
for(int i=0;i< datos.length;i++){
int j=0;
while(j<datos[i].length){
if(datos[i][j].equals(dato)){
return new Posicion(i,j);
}
j+=1;
}
}
return null;
}

@Override
public String getData(String[][] datos, Posicion posicion) {
return null;
return datos[posicion.getX()][posicion.getY()];
}
}

28 changes: 27 additions & 1 deletion src/main/java/com/oracle/arrays/impl/UnidimensionalImpl.java
Original file line number Diff line number Diff line change
Expand Up @@ -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]){
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()

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]){
Copy link
Owner

Choose a reason for hiding this comment

The 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;
}
}