algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 01:18:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update keyFinder.js

Browse Source 
1. modified the identifiers and used the suitable identifiers for the variables
2. leave the loop when a key is match and found to increase the speed of searching in this stage of development
3. return the key number if founded, return 0 if found nothing
This commit is contained in:
Wan Cheuk Lun
2018-10-31 10:10:17 +08:00
committed by GitHub
parent 6c894a2aa5
commit a93d5cfe67
1 changed files with 2 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
Ciphers/keyFinder.js
View File

@ -5,11 +5,9 @@ Note: This is a draft version, please help to modify, Thanks!
function keyFinder(str){ // str is used to get the input of encrypted string
const wordbank =["is","Is","am","Am","are","Are","have","Have","has","Has","may","May","be","Be"];
let key = 0; // return zero means the key can not be found
//var shiftNum = 0; //count the number of key shifted
let inStr = str.toString(); //convert the input to String
let outStr = ""; // store the output value
let wordInOutStr = ""; // temporary store the word inside the outStr, it is used for comparison
//document.getElementById("debug").innerHTML = shiftNum; // debug: display the shifted number(s)
for (let i=0; i<(52); i++){ //try the number of key shifted, the sum of character from a-z and A-Z is 26*2=52
outStr = caesarCipherEncodeAndDecodeEngine(inStr,i); // use the encrytpion engine to decrypt the input string, shiftNum=i
for ( let i=0; i<wordbank.length; i++){
@ -20,9 +18,9 @@ function keyFinder(str){ // str is used to get the input of encrypted string
// this part need to be optimize with the calculation of the number of occurance of word's probabilities
// linked list will be used in the next stage of development to calculate the number of occurace of the key
if (wordbank[i] == wordInOutStr){
return key=i;
return key=i; // return the key number if founded
}
}
}
return key;
return 0; // return 0 if found nothing
}