Chapter 5, Problem 44CRP

Explanation of Solution

Algorithm to lists all possible rearrangements of the symbols in a string:

The algorithm for lists all possible rearrangements of the symbols in a string of five distinct character is shown below:

Step 1: Start

Step 2: Define the function “permutationFucntion” that is for returns the all possible list of rearrangements for given string using “join” function.

Step 3: Define the function “permuteFunction” that is for compute the rearrangement for given string with three arguments such as “string”, “starting index” and “last index”.

If starting index is equal to last index

Display the string by calling the function “permutationFunction”.

Else

Check the range of starting index and last index using “for” loop.

Swap the string index using “nstr[startIndex], nstr[i] = nstr[i], nstr[startIndex]”.

Recursively call the function “permuteFunction” with given string, increment of starting index and last index.

After calling function, then swap the string index using “nstr[startIndex], nstr[i] = nstr[i], nstr[startIndex]”.

Step 4: Assign the sample string

Step 5: Compute the length of string

Step 6: List the given sample string

Step 7: Call the permutation function with list string, value of starting index and “length of string – 1”.

Step 8: Stop

Algorithm Explanation:

The given algorithm is used to lists all possible rearrangements of given string of five distinct characters.

• From the given algorithm, the function “permutationFunction” is used to displays the list of rearrangement string using “join” function.
• Then compute the possible rearrangement using the function “permuteFunction”.
  • In this function, first check whether the staring index is equal to the last index...