>>11800505Not that guy but handling data input has nothing at all to do with algorithm design. No description of quicksort has a "check that user supplied a list of sortable elements", or "check that each element is comparable to each other element". You say, (or very often it's just implied) given a sortable list, bla bla bla. Similarly with palindrome, given a string, bla bla bla.
I agree that if your language doesn't restrict input by data type, you need to handle it yourself. You do not however need to describe how you do that in your description of your algorithm that actually solves the problem, however, because it's largely uninteresting.
Also, 0-length strings very much are palindromes. It's much nicer that way, and they fit any definition that does not explicitly exclude them.
