Split a number into smaller numbers

// C program 
// Split a number into smaller numbers
#include <stdio.h>

#include <stdlib.h>
 // Define stack node
struct StackNode
{
	int element;
	struct StackNode *next;
};
// Define a custom stack
struct MyStack
{
	struct StackNode *top;
	int size;
};
struct MyStack *newStack()
{
	//Make a stack
	struct MyStack *stack = (struct MyStack *) malloc(sizeof(struct MyStack));
	if (stack != NULL)
	{
		//Set node values
		stack->top = NULL;
		stack->size = 0;
	}
	else
	{
		printf("\n Memory overflow when create new stack\n");
	}
}
//Create a new node of stack
struct StackNode *newNode(int element, struct StackNode *next)
{
	//Make a new node
	struct StackNode *node = (struct StackNode *) malloc(sizeof(struct StackNode));
	if (node == NULL)
	{
		printf("\n Memory overflow when create new stack Node \n");
	}
	else
	{
		node->element = element;
		node->next = next;
	}
	return node;
}
// Returns the status of empty or non empty stacks
int isEmpty(struct MyStack *stack)
{
	if (stack->size > 0 && stack->top != NULL)
	{
		return 0;
	}
	else
	{
		return 1;
	}
}
// Add node at the top of stack
void push(struct MyStack *stack, int element)
{
	// Add stack element
	stack->top = newNode(element, stack->top);
	stack->size++;
}
// return top element of stack
int peek(struct MyStack *stack)
{
	return stack->top->element;
}
// Remove top element of stack
void pop(struct MyStack *stack)
{
	if (isEmpty(stack) == 0)
	{
		struct StackNode *temp = stack->top;
		// Change top element of stack
		stack->top = temp->next;
		// remove previous top
		free(temp);
		temp = NULL;
		stack->size--;
	}
}
int size(struct MyStack *stack)
{
	return stack->size;
}
// Display stack elements in reverse order
void show(struct StackNode *top)
{
	if (top == NULL)
	{
		return;
	}
	// Get top element
	int element = top->element;
	// next top
	show(top->next);
	// Display element
	printf("  %d", element);
}
// Divide a positive number into a smaller number that is equal to the original number
void split(struct MyStack *stack, int location, int num)
{
	if (num == 0 && size(stack) > 1)
	{
		// Display split
		printf(" [");
		show(stack->top);
		printf("  ]\n");
	}
	for (int i = location; i <= num; i++)
	{
		// Add stack element
		push(stack, i);
		split(stack, i, num - i);
		// Remove top element of stack
		pop(stack);
	}
}
// Handles the request to find subset of given number
void splitNumber(int num)
{
	if (num <= 0)
	{
		return;
	}
	// Define a stack
	struct MyStack *stack = newStack();
	printf("\n Split number %d \n", num);
	split(stack, 1, num);
}
int main()
{
	// Test case
	splitNumber(5);
	splitNumber(6);
	return 0;
}

Output

 Split number 5
 [  1  1  1  1  1  ]
 [  1  1  1  2  ]
 [  1  1  3  ]
 [  1  2  2  ]
 [  1  4  ]
 [  2  3  ]

 Split number 6
 [  1  1  1  1  1  1  ]
 [  1  1  1  1  2  ]
 [  1  1  1  3  ]
 [  1  1  2  2  ]
 [  1  1  4  ]
 [  1  2  3  ]
 [  1  5  ]
 [  2  2  2  ]
 [  2  4  ]
 [  3  3  ]