Arrays:

Solve these problems with iteration and recursion.
Solve these problems using array syntax and pointer arithmetic syntax

Here is an example of the four:

Find the max in an array of n numbers

Iteration using array syntax:
int max(int *array, unsigned int length)
{
	// we would need to specify what to return in this case
	if (length == 0)
		return 0;

	int result = array[0];
	int i;
	for(i=1;i<length;i++)
		if (result < array[i])
			result = array[i];
	return result;
}

Recursion using pointer arithmetic syntax:
(Just to show you how, I am moving the array pointer - not necessary)
int max(int *array, unsigned int length)
{
	// base case(s)
	if (length == 0)
		return 0;
	if (length == 1)
		return *array;

	// smaller case
	// this gives the array starting at the second value
	int result = max(array+1, length-1);

	if (result < *array)
		return *array;
	else
		return result;
}


Other practice problems:
Find the min in an array of n numbers
Find the sum of an array of n numbers
Count how many are less than m in an array of n numbers
Count how many are equal to m in an array of n numbers
Find the index of the value m in an array of n numbers
Find the index of the value m in a sorted array of n numbers