GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Placement Papers  >  Adobe  >  Placement Papers

 Print  |  
Question:  write an O(log2(N)) algorithm to find X^N



November 11, 2007 13:40:47 #8
 Sandeep Phukan   Member Since: Visitor    Total Comments: N/A 

RE: write an O(log2(N)) algorithm to find X^N
 
class powerRecurse {
 
 
 
 public int powerRec(int x,int n){
  
  if ( n==1 ) return x;
  else {
   return x*powerRec(x,--n);
  }
  
 }
 
 
 
 public static void main(String[] a){
  
  System.out.println(new powerRecurse().powerRec(2,4));
 }
 
 
 
}
     

 

Back To Question