Write a recursive function with two unsigned int parameters, m and n. The precon

Question

Write a recursive function with two unsigned int parameters, m and n. The precondition requires 0 <= m and m <= n. The function prints a line of m asterisks, then a line of m+1 asterisks, and so on up to a line of n asterisks. Then the same pattern is repeated backward: a line of n asterisks, then n-1, and so on down to m. The only loop allowed in your implementation is a loop to print a line of m asterisks. You may have two copies of this loop in different places of the implementation. (10 points)

Explanation / Answer

Hi Friend, You have not mentioned about required programming language.

So i have implemented in C.

#include<stdio.h>
int asterisk(unsigned int, unsigned int);
int main()
{
unsigned int m,n;
asterisk(m,n);
return 0;
}
int asterisk(unsigned int m, unsigned int n)
{
if((0<=m)&&(m<=n))
{
for(i=0;i<m;i++)
printf("*");

printf(" ");
asterisk(m+1,n);
asterisk(m-1,n);
}
}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.