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

Update keyFinder.js

Browse Source 
Made 2 changes to optimize the match results:
1. use a loop to find the next digit of wordbank element and compare with outStr's digit
2. this part need to be optimize with the calculation of the number of occurance of word's probabilities
This commit is contained in:
Wan Cheuk Lun
2018-10-30 11:20:32 +08:00
committed by GitHub
parent e41ad76298
commit 7a04d2ad86
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Ciphers/keyFinder.js
View File

@ -8,11 +8,17 @@ function keyFinder(str){ // str is used to get the input of encrypted string
//var shiftNum = 0; //count the number of key shifted
var inStr = str.toString(); //convert the input to String
var outStr = ""; // store the output value
var 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 (var 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 ( var i=0; i<wordbank.length; i++){
if (wordbank[i] == outStr[i]+outStr[i+1]{
// use a loop to find the next digit of wordbank element and compare with outStr's digit
for ( var j=0; j < wordbank[i].length; j++){
wordInOutStr += outStr[i+j];
}
// this part need to be optimize with the calculation of the number of occurance of word's probabilities
if (wordbank[i] == wordInOutStr){
key=i;
}
}