Question: Consider a recursive function called palindromeR(str) that returns true if a string is a palindrome (reads the same backwards and forwards) . What is the
Consider a recursive function called palindromeR(str) that returns true if a string is a palindrome (reads the same backwards and forwards) .
What is the time complexity of palindromeR?
Question options:
|
|
O(n-2) |
|
|
O(log(n)) |
|
|
O(n2) |
|
|
None of other selections are valid |
|
|
O(n)
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
