Bonfire Caesars Cipher

Review: indexOf(searchvalue, fromindex),

Solution 1:
function rot13(encodeStr) {
    var codeArr = encodeStr.split(""); // string to Array
    var decodedArr = []; //Your Result goes here
    var alphabet = ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z","A","B","C","D","E","F","G","H","I","J","K","L","M"];

     for(var i=0;i<codeArr.length; i++){
          if(alphabet.indexOf(codeArr[i])=== -1){
          decodedArr.push(codeArr[i]);
          }
        else{
           for(var j=0; j<alphabet.length; j++){
               if(codeArr[i] ===alphabet[j]){
                  decodedArr.push(alphabet[j+13]);
}
}
}

}
     return decodedArr.join("");
}

Reference: Jack's blog
Solution 2:



Reference: Youtube