Run Code  | API  | Code Wall  | Users  | Misc  | Feedback  | Login  | Theme  | Privacy  | Patreon 

Palindrome Recursive Function Example

Language: Layout:
+ ] Compiler args + ] Show input
Compilation time: 0.62 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0,76 sec 
edit mode |  history  | discussion
[main] Recursive function to determine if aac2bc5ed3de5cb2caa is a palindrome.
[main] The string is a palindrome? 
in isPalindrome, recursion level 0
in isPalindrome, recursion level 1
in isPalindrome, recursion level 2
in isPalindrome, recursion level 3
in isPalindrome, recursion level 4
in isPalindrome, recursion level 5
in isPalindrome, recursion level 6
in isPalindrome, recursion level 7
in isPalindrome, recursion level 8
in isPalindrome, recursion level 9
in isPalindrome, recursion level 9 returning 1
in isPalindrome, recursion level 8 returning 1
in isPalindrome, recursion level 7 returning 1
in isPalindrome, recursion level 6 returning 1
in isPalindrome, recursion level 5 returning 1
in isPalindrome, recursion level 4 returning 1
in isPalindrome, recursion level 3 returning 1
in isPalindrome, recursion level 2 returning 1
in isPalindrome, recursion level 1 returning 1
in isPalindrome, recursion level 0 returning 1
1