Hello Everyone!

I'm trying to implement a recursive implementation of the following function


**We are allowed to use also \[ Multiplexer(2^n : 1) \] gates.

If anyone has any idea and wants to share it I'd be glad to hear

Have a great day!

 

@weaver20 What language are you using? Recursive means it calls itself... that isn't difficult. What you are asking is how to convert your equations into logic, and then into code.

I recommend you use a flow-chart, which will help you create the logic process, that can then be turned into an algorithm.

Flowchart tool (free, online):

https://app.diagrams.net/