Caesar Cipher Frequency Analysis in Java
up vote
0
down vote
favorite
Caesar Cipher using Frequency Analysis** in Java: this is my code for the decode part: public static String decode (String code){ int key=0; final int ALPHABET_SIZE = 26; int freqs = new int[ALPHABET_SIZE]; for (int l=0;l<freqs.length;l++){ freqs[l]=0; } for (int k=0;k<code.length();k++){ if (code.charAt(k)>='a' && code.charAt(k)<='z'){ freqs[code.charAt(k)-'a']++; } } int biggest = 0; for (int t=0;t<freqs.length;t++){ if (freqs[t]>biggest){ biggest= t; } } if (biggest<4){ key = (biggest + 26 - ('e'+'a')); } else{ key = biggest + 'a' - 'e'; } return (decode...