title: counting upper case letters in recursive function
body: <p>i know this is wrong, however just learning how to do recursive functions and trying to understand how to work this out better.</p>
  
  <pre><code>    #include &lt;iostream&gt;
     using namespace std;
  
  
      int getUpper ( const string&amp; s, int high) {
  
        int count=0;
  
  
         if(s.size()&gt;0) {
  
           if (s[0] &lt;='Z' &amp;&amp; s[0] &gt;='A') 
            count++;
  
         return getUpper(s.substr(1,s.size()-1), high-1);
  
      }
       return count;
   }
  
       int getUpper (const string&amp; s){
           int high=s.size()-1;
  
          int count=getUpper(s,high);
        return count;
     }
  
  
     int main()
    {
       string s="WeLC";
      int value=getUpper(s);
      cout &lt;&lt; value;
        return 0;
    }
  </code></pre>
  
  <p>Why is this not returning the count number? of 4.</p>