I need to get this done before midnight tonight and I really need some help...Can someone show me how to code these problems? I have to show the rest of the class how to code it
1. Write a function that accepts a pointer to an array of integers and a single integer. Search the array for the integer and return a pointer to that element in the array. Do not use array notation.
2. Write a function that accepts an integer, prompts the user for that number of values, loads the values into an array (without using array notation) and returns a pointer to the array to the calling function.
3. Write a recursive function that excepts two integers, x and n, calculate x to the nth power and returns the result to the calling function.
Thanks,
Teacher in Training
1. Write a function that accepts a pointer to an array of integers and a single integer. Search the array for the integer and return a pointer to that element in the array. Do not use array notation.
2. Write a function that accepts an integer, prompts the user for that number of values, loads the values into an array (without using array notation) and returns a pointer to the array to the calling function.
3. Write a recursive function that excepts two integers, x and n, calculate x to the nth power and returns the result to the calling function.
Thanks,
Teacher in Training
Comment