Finding all permutations for a set Program Plan: Include required file. Define the structure for node. Declare elements in “vector” type. Declare variable for next value in “NodeValue” type. Declare function for display permutations. Declare function for compute permutations with recursively. Declare function for display vector elements of set. Define main function. Call the function “displayPermutations” with one parameter. Define function “displayPermutations”. Create a pointer for node. Declare the set in “vector” type. Fill the set with first “n” whole elements. Call the function “displayVectorElements” to print the vectors . Then compute the permutation for given set by calling the function “recursivePermutations”. Performs “while” loop. This loop executes until the pointer is equal to “NULL”. Display the values in set by calling the function “displayVectorElements”. Then delete and move to the next value. Define function “recursivePermutations”. This function is used to returns a list holding all of the permutations of the given list of elements. In this function, first assign the pointer list to “NULL”. Then performs base case if the size of the vector element is “1”. Otherwise performs recursive case. Compute the permutations for smaller set of elements by recursively call the function “recursivePermutations”. Define function “displayVectorElements”. This function is used to display the elements of set.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 8PP

Program Plan Intro

Finding all permutations for a set

Program Plan:

Include required file.

Define the structure for node.

Declare elements in “vector” type.

Declare variable for next value in “NodeValue” type.

Declare function for display permutations.

Declare function for compute permutations with recursively.

Declare function for display vector elements of set.

Define main function.

Call the function “displayPermutations” with one parameter.

Define function “displayPermutations”.

Create a pointer for node.

Declare the set in “vector” type.

Fill the set with first “n” whole elements.

Call the function “displayVectorElements” to print the vectors.

Then compute the permutation for given set by calling the function “recursivePermutations”.

Performs “while” loop. This loop executes until the pointer is equal to “NULL”.

Display the values in set by calling the function “displayVectorElements”.

Then delete and move to the next value.

Define function “recursivePermutations”.

This function is used to returns a list holding all of the permutations of the given list of elements.

In this function, first assign the pointer list to “NULL”.

Then performs base case if the size of the vector element is “1”. Otherwise performs recursive case.

Compute the permutations for smaller set of elements by recursively call the function “recursivePermutations”.

Define function “displayVectorElements”.

This function is used to display the elements of set.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Explian thiS C program #include<stdio.h> int countSetBits(int n) { int count = 0; while (n) { count += n & 1; n >>= 1; } return count;} int main() { int num; printf("Enter a number: "); scanf("%d", &num); printf("Output: %d units\n", countSetBits(num)); return 0;}

Please provide the Mathematica code

Explian this C program code. #include <stdio.h> void binary(unsigned int n) { if (n /2!=0) { binary(n /2); } printf("%d", n %2); } int main() { unsignedint number =33777; unsignedchar character ='X'; printf("Number: %u\n", number); printf("Binary: "); binary(number); printf("\nDecimal: %u\nHexadecimal: 0x%X\n\n", number, number); printf("Character: %c\n", character); printf("ASCII Binary: "); binary(character); printf("\nASCII Decimal: %u\nASCII Hexadecimal: 0x%X\n", character, character); return0; }