Write an O(log2(N)) algorithm to find X^N?
Submitted by: Administratorint computeXn(int x, int n)
{
if(n == 2)
{
return x*x;
}
else if(n % 2 == 0)
{
int y = computeXn(x, n/2);
return y*y;
}
else if(n % 2 == 1)
{
int y = computeXn(x, n/2);
return y*y*x;
}
}
Submitted by: Administrator
{
if(n == 2)
{
return x*x;
}
else if(n % 2 == 0)
{
int y = computeXn(x, n/2);
return y*y;
}
else if(n % 2 == 1)
{
int y = computeXn(x, n/2);
return y*y*x;
}
}
Submitted by: Administrator
Read Online Programming Concepts Job Interview Questions And Answers
Top Programming Concepts Questions
| ☺ | Explain how Search engines work? |
| ☺ | Explain what is port? what is HTTP port, FTP port, Telnet port and others? |
| ☺ | What is the client business process in electronic industry (in mySAP CRM)? |
| ☺ | Explain how to get 1,4,7,10.....rows from a table? |
| ☺ | Write an O(log2(N)) algorithm to find X^N? |
Top Coding/Programming Categories
| ☺ | Python Interview Questions. |
| ☺ | OOP Interview Questions. |
| ☺ | Software engineering Interview Questions. |
| ☺ | PHP Interview Questions. |
| ☺ | VBA (Visual Basic for Applications) Interview Questions. |
