title: Recursive algorithm to check whether String has Balanced Parenthesis
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/2711032/basic-recursion-check-balanced-parenthesis">Basic Recursion, Check Balanced Parenthesis</a>  </p>
  </blockquote>
  
  
  
  <p>I came across this problem in Algorithm Design Manual recently, even though the stack based algorithm is very trivial I want to write a recursive algorithm for this problem, However with being a noob in recursion I am not able to come up with much, so can anyone help me with this problem?</p>
  
  <p>PS I saw other posts about this question only but they are not very efficient and those who are, aint very explanotry. </p>