I would like to generate a Search tree for a permutation problem. My requirement is as follows: I want to use a Divide and Conquer strategy for doing so
I am giving an example tree length 3 Permutation.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I would like to generate a Search tree for a permutation problem. My requirement is as follows: I want to use a Divide and Conquer strategy for doing so
I am giving an example tree length 3 Permutation.
Given a set of
nnumbers, divide the problem intonsubproblems, each having one of the numbers from the set as the first number and the chosen number removed from the set. For each subproblem, repeat the process. If set is empty, stop.