title: Big-O and Big-Omega of a recursive method
body: <p>I'm tasked with trying to find the big-O and big-Omega of the given Java method but have no idea how. I know that big-O gives the upper bound and big-Omega gives the lower bound but how exactly am I to figure this out when looking at a program not to mention a recursive one? 
  Thank you in advance, this will help immensely in my studies. </p>
  
  <pre><code>public static boolean goal(int i, int n){
      if(n == 0){
          if( i == 91) {
              System.out.println("i = " + i +", DONE!!!");
              return true;
          }
          else {
              return false;
          }
  
      }
      else if(i % 2 == 1){
          if(goal(i + 53,n - 1))
          {
              System.out.println("i = "+ i + ", step # " + n);
              return true;
          }
          else
              return false;
      }
      else {
         if( goal(i + 53,n - 1) || goal(i / 2,n - 1))
         {
              System.out.println("i = "+ i +", step # " + n);
              return true;
         }
         else
              return false;
      }
  }
  </code></pre>