Makes a recursive call to put a queen on the next row

Assignment Help Computer Engineering

Reference no: EM132106329

(program in c)

void perm_rec_1(int N, int nr_values) - A recursive SOLUTION. The wrapper function that will be called from main() must have the signature shown here "void perm_rec_1(int N, int nr_values)" and it does NOT have to be recursive.

However this wrapper function can call a helper function and the helper function can have any number of arguments (of any type) and it MUST be recursive.

The recursive solution should work as follows:

The function will know it hit the base case because the position (or the column) is out of bounds (NOT because you generated all possible permutations).

(For example, for 3 positions and 2 values, the total number of permutations is 8 (=2^3). Do not count the different permutations and stop when you reached 8. Instead, stop because now you are trying to set position 4 and that is out of bounds.)

In the base case print the array

In the recursive case do something similar to what happens in the queens program. There, in the recursive case, there is a loop to try and place the queen at all the columns on this row and if it finds a good position, it places it there and makes a recursive call to put a queen on the next row.

Reference no: EM132106329

Questions Cloud

Judgments and decision making : Evaluate why critical thinking applies to all scientific pursuits, and also why it should guide everyday judgments and decision making.

How to make good decisions and problem solve : I need help learning how to make good decisions and problem solve so my motivation is not impacted during school or at work.

Pros and cons of insisting that the entire family : What are the pros and cons of insisting that the entire family attend the initial consultation? What would you do if you learned that some of the family members

Explain the basic concept of the process management : How a single process (parent process) creates a child process and how they work on Unix/Linux(/Mac OS X/Windows) environment.

Makes a recursive call to put a queen on the next row : The function will know it hit the base case because the position (or the column) is out of bounds (NOT because you generated all possible permutations).

Perform three function calls : Write a program that does the following: .Declare three integer variables in main0, called var1, var2, var3 .

Write the function body for each : Fix this program, so that this program prints out the numbers 1 to 10. What does it do as currently written ?

Convert the character in r0 from upper-case to lower-case : Convert the character in R0 from upper-case to lower-case by operating on it, NOT replacing it. The lower-case converted character should stay in R0.

Difference for a two-tailed test : If the sample mean difference (i.e. M1 - M2) is 8 points, is this enough to indicate a significant difference for a two-tailed test at the .05 level?

User Account

All Pages