title: Time compexity of palindrome recursive algorithm
body: <p>I have written this recursive function to find the palindrome.</p>
  
  <pre><code>def palindrome(string):
      print("palindrome called with:"+string)
      if(len(string)&lt;=3):
          return string[0]==string[-1]
      else:
          res=palindrome(string[1:-1])
          print("palindrome returned:"+str(res))
          return res
  </code></pre>
  
  <p>I have yo find the time complexity of this algorithm of it now.
  My questions
  <strong>is my base case right?</strong> which is len&lt;=3?
  <strong>I'm unable to relate this to classic examples of fibonacci and factorial</strong> algorithm which are everywhere on internet.</p>