Print Triangle separated pattern

Given a number N, the task is to print the triangle-separated pattern.

Triangle Separated Pattern: Pattern in which four triangles (left, down, right, up) are separated by forward and backward slash, see this below: 
\*****/ 
*\***/* 
**\*/** 
***/*** 
**/*\** 
*/***\* 
/*****\ 

Note: N should be an odd number and the value of N should be more than 4.
Examples: 

Input: N = 5
Output: 
        \***/
        *\*/*
        **/**
        */*\*
        /***\

Input: N = 7
Output:
        \*****/
        *\***/*
        **\*/**
        ***/***
        **/*\**
        */***\*
        /*****\

Approach: By observing the above pattern, when the indexes of rows and columns are equal, then ” is printed and when the sum of indexes of rows and columns is N, then ‘/’ is printed. Below is the recursive approach:

1. Use two values i for rows and j for columns, which iterates from (0, 0) to (N-1, N-1) for printing the required pattern.
2. Recursively iterates from (0, 0) to (N-1, N-1): 
   • Base Case: If indexes of rows and columns are greater than or equal to N is the termination condition for the given pattern.  

if(i >= N) {
  return 0;
}
if(j >= N) {
  return 1;
}
 

• Print Statement: If the base case condition is not met, then print ‘/’, ” and ‘*’ on the basis of the below conditions:  

if(i==j) {
   print('')
}
else if(i + j == N-1) {
   print('/')
}
else {
   print('*')
}
 

• Recursive Call: At each recursive call(except the base case), return the recursive function for next iteration for rows and columns:  

// Recursive call for rows
recursive_function(i, j+1, N)

// Recursive call for changing rows
recursive_function(i+1, j, N)
 

Below is the implementation of the above approach:

\*******/
*\*****/*
**\***/**
***\*/***
****/****
***/*\***
**/***\**
*/*****\*
/*******\

Time Complexity: O(N²), as we are making recursive calls for n times, and each time the loop is executed for n times.
Auxiliary Space: 0(1), as no extra space is used.