Question

can anyone please help me to write a recursive ( must in recursive function) function in c++ to print the asterisk pattern in the screenshot below. thanks

as this:

Answer 1

Below is the recursive implementation of the code. Comments are added in the code itself. The logic of the code is a recursive function which is being executed in a bottom-up manner. The recursive function has two parts, one is the base case which handles the termination of the recursion properly and other is the normal recursion. Fin below the code, the screenshot of the code and the desired output. Try to dry run the code on a paper to understand the logic.

Code

#include <bits/stdc++.h>
#include <iostream>
using namespace std;
void asterisk_recur(int n,int c)
{
   // Base case or Termination case
   if(n==1)
   {
       // appending the space characters
       for(int i=0;i<c;i++)
           cout<<" ";
       cout<<"*";
   }
   else
   {
       asterisk_recur(n/2,c);
       cout<<"\n";
       // appending the space characters
       for(int it=0;it<c;it++)
           cout<<" ";
        // print the asterisks
        for(int it=0;it<n;it++)
           cout<<"* ";
        cout<<"\n";
        asterisk_recur(n/2,c+n);
        }
}

// main function
int main()
{
   // calling the recursive function to generate pattern
   asterisk_recur(8,0);
    return 0;
}

Screenshot

1 #include <bits/stdc++.h> 2 #include iostream» 3 using namespace std; 4 void asterisk_recur(int n,int c) /Base case if(n-=1) or Termination case 6 7 9 10 appending the space characters for( int i-e;ic;i++) cout<<""; 12 13 14 15 ▼ 16 17 18 19 20 21 cout < " * else asterisk_recur(n/2,c); coutくく..\n"; appending the space characters for(int it-e;it<c;it++) cout<<" "; //print the asterisks for(int it-e;it<n;it++) 23 cout<<"*" coutくく"\n"; asterisk_recur(n/2,c+n); 25 26 27 28 9 main function 30 int main() 31 ▼ 32 //calling the recursive function to generate pattern asterisk_recur(8,0); return 0; 35

Output