Program in Java: Reverse of a string using recursion
import java.util.Scanner;
class reverse
{
String rev(String s,int l) //s string and l is length of the string
{
if(s.length()==0)
return "";
return s.charAt(l-1)+rev(s.substring(0,l-1),l-1);
}
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a word:");
String str = sc.next();
reverse ob = new reverse();
int n = str.length();
String r = ob.rev(str,n);
System.out.println("The reverse:"+r);
}
}
class reverse
{
String rev(String s,int l) //s string and l is length of the string
{
if(s.length()==0)
return "";
return s.charAt(l-1)+rev(s.substring(0,l-1),l-1);
}
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a word:");
String str = sc.next();
reverse ob = new reverse();
int n = str.length();
String r = ob.rev(str,n);
System.out.println("The reverse:"+r);
}
}