Java Program to Reverse a Sentence Using Recursion Last Updated : 11 Sep, 2022 Comments Improve Suggest changes Like Article Like Report A sentence is a sequence of characters separated by some delimiter. This sequence of characters starts at the 0th index and the last index is at len(string)-1. By reversing the string, we interchange the characters starting at 0th index and place them from the end. The first character becomes the last, the second becomes the second last, and so on. Example: Input : GeeksforGeeks Output: skeegrofskeeG Input : Alice Output: ecilAApproach: Check if the string is empty or not, return null if String is empty.If the string is empty then return the null string.Else return the concatenation of sub-string part of the string from index 1 to string length with the first character of a string. e.g. return substring(1)+str.charAt(0); which is for string "Mayur" return will be "ayur" + "M". Below is the implementation of the above approach: Java // Java Program to Reverse a Sentence Using Recursion import java.io.*; public class GFG { public static String reverse_sentence(String str) { // check if str is empty if (str.isEmpty()) // return the string return str; else { // extract the character at 0th index, that is // the character at beginning char ch = str.charAt(0); // append character extracted at the end // and pass the remaining string to the function return reverse_sentence(str.substring(1)) + ch; } } public static void main(String[] args) { // specify the string to reverse String str = "Geeksforgeeks"; // call the method to reverse sentence String rev_str = reverse_sentence(str); // print the reversed sentence System.out.println( "Sentence in reversed form is : " + rev_str); // creating another string with numbers // and special characters String str2 = "Alice"; String rev_str2 = reverse_sentence(str2); // print the reversed sentence System.out.println( "Sentence in reversed form is : " + rev_str2); } } OutputSentence in reversed form is : skeegrofskeeG Sentence in reversed form is : ecilA Time Complexity: O(N), where N is the length of the string. Auxiliary Space: O(N) for call stack Comment More infoAdvertise with us Next Article Java Program to Reverse a Sentence Using Recursion Y yashkumar0457 Follow Improve Article Tags : Java Java Programs Practice Tags : Java Similar Reads Introduction to Recursion The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read What is Recursion? Recursion is defined as a process which calls itself directly or indirectly and the corresponding function is called a recursive function.Example 1 : Sum of Natural Numbers Let us consider a problem to find the sum of natural numbers, there are several ways of doing that but the simplest approach is 8 min read Difference between Recursion and Iteration A program is called recursive when an entity calls itself. A program is called iterative when there is a loop (or repetition).Example: Program to find the factorial of a number C++ // C++ program to find factorial of given number #include<bits/stdc++.h> using namespace std; // ----- Recursion 6 min read Types of Recursions What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inord 15+ min read Finite and Infinite Recursion with examples The process in which a function calls itself directly or indirectly is called Recursion and the corresponding function is called a Recursive function. Using Recursion, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Tr 6 min read What is Tail Recursion Tail recursion is defined as a recursive function in which the recursive call is the last statement that is executed by the function. So basically nothing is left to execute after the recursion call.For example the following function print() is tail recursive.C++// An example of tail recursive funct 7 min read What is Implicit recursion? What is Recursion? Recursion is a programming approach where a function repeats an action by calling itself, either directly or indirectly. This enables the function to continue performing the action until a particular condition is satisfied, such as when a particular value is reached or another con 5 min read Why is Tail Recursion optimization faster than normal Recursion? What is tail recursion? Tail recursion is defined as a recursive function in which the recursive call is the last statement that is executed by the function. So basically nothing is left to execute after the recursion call. What is non-tail recursion? Non-tail or head recursion is defined as a recur 4 min read Recursive Functions A Recursive function can be defined as a routine that calls itself directly or indirectly. In other words, a recursive function is a function that solves a problem by solving smaller instances of the same problem. This technique is commonly used in programming to solve problems that can be broken do 4 min read Difference Between Recursion and Induction Recursion and induction are fundamental ideas in computer science and mathematics that might be regularly used to solve problems regarding repetitive structures. Recursion is a programming technique in which a function calls itself to solve the problem, whilst induction is a mathematical proof techn 4 min read Like