Write a program to reverse the string. input = google output = elgoole */




  #include<iostream>
  #include<string>
  using namespace std;

void rvrsstr(string a)//rvrsstr=reverse string:user function
{     if(a.size()==0)
        {return;}
        rvrsstr(a.substr(1));
        cout<<a[0];
                          }
    int main()
    {   string a;
         a="google";
         rvrsstr(a);
      return 0;
     }

Comments

Post a Comment

If you have any doubt ,let me know

Popular posts from this blog

FALSE POSITION METHOD

Image
  FALSE POSITION METHOD , USE : • Find root of contineous function of f(x). APPROACH : a) Find interval [a b] such that as     • f(a) and (b) must have different Signs       Somewhere in between must be Zero. b) Compute Secant between  and b*f(b)). c) Take point c which be present on Secant as well as x axis. d) Replace a or b with matching.    Sign of f(c)    Such that F (a)* F (c)<0 or   F (b)* F (c)<0  e)Repeat this_ process upto giver   iterations.   calculated C  =(a*func(b)-b*func(a))/(func(b)-func(a)); FLOWCHART of FALSE position method STEP 1)Take two points a and b , and find f(a)*f(b)<0     STEP 2) we draw Secant between f(a) and f (b) is secant         AB line is a Secant.         Now we choose C where secant cut to the X axis. STEP 3) Cheak    fu...
Read more

Write the program to arrange the n queen(queen of chessboard) in n*n matrix such that they can not ATTACK TO eachother.

Image
  OUTPUT : In form of matrix of elements (0 and 1)     where 1 is suitable position where can be keep without attack to each other.   USED : Recursion , BACKTRACKING etc CHARACTERISTICS   OF QUEEN :     A )They can move in any position in a row where it is presence.     B )They can move in any position in a column where it is presence.     C )They can move in any position in a diagonal where it is presence. CONDITION :     Arrange the queen such that they can not ATTACK to each other.     in n*n matrix       APPROCH :    A )put a queen in a row than move next row to put      the next queen in next row such that they can not ATTACK each other        After matrix 4 they are not any place where a queen can be Put without attack by anyone so BACKTRACK occur here and reach again to Matrix 1 and then continue...
Read more

DNF sorting ( 0s , 1s , 2s, sorting )

Image
ABOUT  DNF  SORTING  WHAT IS SORTING?   Sorting    is   a   process   of   arranging   items (   any things   ex :- ,elements in array   , table , marks , price of things etc)   in systematically   such that   in ascending   or descending    in form of   correctly   sequence . 1.          Ordering :- Arranging items   in a sequence ordered by some   strategy. 2.        Categorizing :- grouping elements in similar properties.                                    WHAT IS DNF SORTING?   It is   also   known   as Dutch National Flag   .Some times    It is known    by     0 ,1, 2s sorting. ...
Read more