algorithm quiz q-9 …explain the space complexity
Algorithm quiz q-9?
Q9. Algorithms STL#9
A student just learnt the reverse() function in c++ STL. He writes the following algorithm to check if a given string S is a palindrome.
bool isPalindrome(string& s)
string rev = s
reverse(rev.begin(), rev.end())
return s == rev
Is the algorithm correct? What is the space and time complexity
@mehulbhandari358 hey time complexity will be O(length of ll) ans space complexity will be O(length of ll) as extra string is taken to store rev.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.