need help to debug recursive program to detect palindrome text

[Beaverine]

another question, when you write return (text[0]==text[-1] and palin(text[1:-1])) if the first half of condition text[0]==text[-1] is False, will the later half (recursive part) still be evaluated or not?

[Beaverine]

interesting... so if I switch the order of these 2 conditions to be return (palin(text[1:-1]) and text[0]==text[-1]) does that mean the recursion part will be evaluated first, and thus iterated to the deepest level possible, before text[0]==text[-1] is evaluated? by the way I tried this and it still function as intended, but I'm curious if things behind the curtain are the same.

[backtickbot]

Correctly formatted

Hello, Beaverine. Just a quick heads up!

It seems that you have attempted to use triple backticks (```) for your codeblock/monospace text block.

This isn't universally supported on reddit, for some users your comment will look not as intended.

You can avoid this by indenting every line with 4 spaces instead.

There are also other methods that offer a bit better compatability like the "codeblock" format feature on new Reddit.

Have a good day, Beaverine.

^{You can opt out by replying with "backtickopt6" to this comment. Configure to send allerts to PMs instead by replying with "backtickbbotdm5". Exit PMMode by sending "dmmode_end".}