palindrome_recursion_checker.js

// Returns the first character of the string str
var firstCharacter = function(str) {
    return str.slice(0, 1);
};

// Returns the last character of a string str
var lastCharacter = function(str) {
    return str.slice(-1);
};

// Returns the string that results from removing the first
//  and last characters from str
var middleCharacters = function(str) {
    return str.slice(1, -1);
};

var isPalindrome = function(str) {
    // base case #1
    var result;
    if(str.length===1|| str.length===0){
        return true;
    }
    if(firstCharacter(str)!==lastCharacter(str)){
        return false;
    }
    middleCharacters(str);
    if(firstCharacter(str)===lastCharacter(str)){
        return isPalindrome(middleCharacters(str));
    }
    
    return true;
    
    // base case #2
    // recursive case
};

var checkPalindrome = function(str) {
    println("Is this word a palindrome? " + str);
    println(isPalindrome(str));
};

checkPalindrome("a");
Program.assertEqual(isPalindrome("a"), true);
checkPalindrome("motor");
Program.assertEqual(isPalindrome("motor"), false);
checkPalindrome("rotor");
Program.assertEqual(isPalindrome("rotor"), true);