Hi

I am asking my question. I think this problem is related to Dynamic programming concept.

Problem:

We have n operands and m operators. For example:

operands = {a,b,c,d}

operators = {*, -, +, /}

We must put operators between operands and create all of the possibility permutations.

F1 = a+b+c+d

F2 = a+b+c-d

F2 = a+b-c-d

…

Fi = a*b+c/d;

I could not implement the problem.

Is there anyone help me?