Functions

Additional Exercises

1. The following function raises an integer to a given power ( X^n )

   int power (int x, int n)
   {
           int p;
           for (p = 1; n > 0; n--)
                   p = p * x;
           return p;
   }
   

   Add a main program to prompt the user to enter a integer and the desired power then call the function, and finally print out the answer. Remember to add a function prototype.

   Revision

   The power to raise the integer to, n must be a positive integer. Check that the value entered is positive, if it is not do not let the user proceed until a positive value is entered (see notes on Iteration).

2. The above is an iterative method of calculating the value of X^n, write a recursive function to calculate the value of a number (base) raised to a power (power). Assume the power is positive.

3. The Arrays Example looked at writing a program to determine if an array contained a palindrome. Rewrite this exercise, so that you now have a function that when sent an array, will return a 1 if the array is a palindrome and will return a 0 otherwise. The function will be sent the array of integers.

   Now re-write the main program to call this function and then display if the array is a palindrome.

Back to Main Page for Lecture 6