Question: Consider a recursive function called permuteR(string,position) that returns each reordering of the letters in a string. Which of the following is TRUE about permuteR? permuteR's
Consider a recursive function called permuteR(string,position) that returns each reordering of the letters in a string.
Which of the following is TRUE about permuteR?
permuteR's time complexity can be improved with memoization
permuteR's time complexity cannot be improved with memoization
permuteR's space complexity can be improved if it was written in C
permuteR's space complexity cannot be improved no matter which language it is implemented in
Question options:
|
|
1 |
|
|
1 and 4 |
|
|
4 |
|
|
1 and 3 |
|
|
2 |
|
|
2 and 4 |
|
|
2 and 3 |
|
|
3
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
