Give the algorithmic complexity of the following loops:

for(i=0;i<n;i++)
	do something;

for(i=0;i<n;i+=2)
	do something;

for(i=1;i<n;i*=2)
	do something;

for(i=0;i<n;i++)
   for(j=0;j<n;j++)
	do something;

for(i=0;i<n;i++)
   for(j=0;j<m;j++)
	do something;

for(i=0;i<n;i++)
   for(j=0;j<i;j++)
	do something;

Determine the algorithmic complexity of the following recursive
functions:

int recursiveFun1(int n)
{
	if (n <= 0)
		return 1;
	else
		return 1 + recursiveFun1(n-1);
}

int recursiveFun1(int n)
{
	if (n <= 0)
		return 1;
	else
		return 1 + recursiveFun1(n-5);
}

int recursiveFun1(int n)
{
	if (n <= 0)
		return 1;
	else
		return 1 + recursiveFun1(n/5);
}

void recursiveFun1(int n, int m, int o)
{
	if (n <= 0)
	{
		printf("%d, %d\n",m, o);
	}
	else
	{
		recursiveFun1(n-1, m+1, o);
		recursiveFun1(n-1, m, o+1);
	}
}

int recursiveFun1(int n)
{
	for(i=0;i<n;i+=2)
		do something;

	if (n <= 0)
		return 1;
	else
		return 1 + recursiveFun1(n-5);
}