You are on page 1of 2

3 recursividad

package recursividad;

import java.util.Scanner;

public class PruebaConversion {

public static void main(String[] args) {


Scanner sc=new Scanner(System.in);
System.out.println("Ingrese número en base 10
");
int n=sc.nextInt();
System.out.println("El número en base 2 es: ");
conversion(n);

}
public static void conversion(int n) {

if (n>0) {
conversion(n/2);
System.out.print(n%2);

}
}}

package recursividad;

import java.util.Scanner;

public class InvertirPalabra {

public static void main(String[] args) {


Scanner sc=new Scanner(System.in);
System.out.println("Ingrese palabra o frase");
String palabra=sc.next();
int tamaño=contar(palabra);
char[] frase= new char[tamaño];
for (int i = 0; i < frase.length; i++) {
frase[i]= palabra.charAt(i);
}
imprimir(frase,tamaño);
}

public static int contar(String a) {


int b =a.length();
return b;
}
public static void imprimir(char[] a, int b) {
if (b>0) {
System.out.print(a[b-1]);
imprimir(a,b-1);
}
}
}

You might also like