Talk:Palindrome detection: Difference between revisions
Content added Content deleted
(Haskell recursive solution note) |
(→Haskell recursive solution note: e.g. this) |
||
| Line 2: | Line 2: | ||
I suppose the Haskell recursive code can be written a lot better, but I don't know how. --[[User:ShinTakezou|ShinTakezou]] 14:08, 5 December 2008 (UTC) |
I suppose the Haskell recursive code can be written a lot better, but I don't know how. --[[User:ShinTakezou|ShinTakezou]] 14:08, 5 December 2008 (UTC) |
||
: Does this look better to you? |
|||
<pre> |
|||
is_palindrome_r x | length x <= 1 = True |
|||
| head x == last x = is_palindrome_r . tail. init $ x |
|||
| otherwise = False |
|||
</pre> |
|||
:--[[User:Gaaijz|Gaaijz]] 14:37, 5 December 2008 (UTC) |
|||
Revision as of 14:37, 5 December 2008
Haskell recursive solution note
I suppose the Haskell recursive code can be written a lot better, but I don't know how. --ShinTakezou 14:08, 5 December 2008 (UTC)
- Does this look better to you?
is_palindrome_r x | length x <= 1 = True
| head x == last x = is_palindrome_r . tail. init $ x
| otherwise = False
- --Gaaijz 14:37, 5 December 2008 (UTC)