面试求x的n次方 c语言 数据结构 超详细 简单易懂~~

#include<stdio.h>
#include<stdlib.h>
int function1(int x,int n)
{
int result = 1;
for (int i = 0; i < n; i++)
{
result = x;
}
return result;
}
int function2(int x, int n)
{
if (n == 0)
return 1;
else
return function2(x, n - 1) x;
}
int function3(int x, int n)
{
if (n == 0)
return 1;

else
{
	if (n % 2 == 1)
	{
		return function3(x, n / 2) * function3(x, n / 2) * x;
	}
	else
	{
		return function3(x, n / 2) * function3(x, n / 2);
	}
}

}
int function4(int x, int n)
{
if (n == 0)
return 1;
else
{
int t = function4(x, n / 2);
if (n % 2 == 1)
{
return ttx;
}
else
{
return t*t;
}
}
}
int main(void)
{
int x = 2;
int n = 3;
int m = function1(x, n);
printf("%d\n", m);
m = function2(x, n);
printf("%d\n", m);
m=function3(x, n);
printf("%d\n", m);
m=function4(x, n);
printf("%d\n", m);
system(“pause”);
return 0;
}