Challenge: Beckett's Problem
Explore how to solve Beckett's Problem by creating a recursive function called moves. Understand how to direct actors to enter and exit the stage so each subset appears exactly once. Gain practical experience in implementing and testing recursion in C.
We'll cover the following...
We'll cover the following...
Problem statement
You are given a number of actors, n, in input. Your task is to write a recursive function for Stage Directions. Indicate when which actor should Enter or Exit.