Question: Consider a recursive function called permuteR(string,position) that returns each reordering of the letters in a string. What is the time complexity of permuteR? Question options:
Consider a recursive function called permuteR(string,position) that returns each reordering of the letters in a string.
What is the time complexity of permuteR?
Question options:
|
|
O(n) |
|
|
O(log(n)) |
|
|
O(n!) |
|
|
O(n2) |
|
|
O(2n)
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
