diff --git a/EF1.java b/EF1.java
index 66ebb69..0637632 100644
--- a/EF1.java
+++ b/EF1.java
@@ -6,10 +6,10 @@ public static void main(String args[]){
 	}	
 
 	public static int Factorial(int n){
-		if(){//Escribir condición de salida 
+		if(n==0){//Escribir condición de salida 
 			return 1;  
 		}else{//Escribir el retorno para la recursividad
-
+			return fac * (factorial(fac - 1));
 		}
 	}
 }
\ No newline at end of file
diff --git a/EF2.java b/EF2.java
index c70e201..bf69a18 100644
--- a/EF2.java
+++ b/EF2.java
@@ -3,6 +3,37 @@ public class EF2{
 	public static void main(String args[]){
 		
 		
+		public static void main(String[] args) {
+		int[] cadena= {2, 3, 8, 109, 13, 4, 18, 10, 23, 18, 50, 11, 13, 2};
+		int aux;
+
+		System.out.print("{");
+		
+		for(int i=0;i<cadena.length;i++) {
+			for(int j=i+1;j<cadena.length;j++) {
+				if(cadena[i]>cadena[j]) {
+					aux=cadena[i];
+					cadena[i]=cadena[j];
+					cadena[j]=aux;
+				 
+					}
+			
+				}
+				
+			if(i<cadena.length-1) {
+				System.out.print(cadena[i]+", ");
+			}
+			else {
+				System.out.print(cadena[i]);
+			}
+
+		}
+			
+			System.out.print("}");
+		
+		}
+
+
 	}