Java Shift Caesar Cipher by shift spaces. Restrictions: Only works with a positive number in the shift parameter. Only works with shift less than 26. Does a += which will bog the computer down for bodies of text longer than a few thousand characters. Does a cast number to character, so it will fail with … Read more
I realize that this answer doesn’t really answer your question, but I think it’s helpful anyway. Here’s an alternative way to implementing the caesar cipher with string methods: def caesar(plaintext, shift): alphabet = string.ascii_lowercase shifted_alphabet = alphabet[shift:] + alphabet[:shift] table = string.maketrans(alphabet, shifted_alphabet) return plaintext.translate(table) In fact, since string methods are implemented in C, we … Read more
First of all, you have to follow the specifications of the problem. That is, you have to print out the word ‘plaintext:’ before taking input and print out ‘ciphertext:’ before giving any output. As the checking process is automated, this becomes very important. Notice the case of those words in your problem statement. Secondly, I … Read more
You should probably have a look at https://en.wikipedia.org/wiki/Segmentation_fault. Basically it means that your code is trying to use data at an address in an invalid way. A common case in C code is something like this: char * cptr = NULL ; cptr = some_function_returning_null(); printf(“%s\n”cptr); The memory at pointer cptr has never been set … Read more
First of all, there are some braces missing in the if blocks. They look like this if (encrypt <= ‘A’ && encrypt >= ‘Z’) { encrypt = encrypt + shift; But there should be a } after that. Also, you have conditions like those: (encrypt <= ‘a’ && >= ‘z’) I think you meant (encrypt … Read more
A simple implementation of the Caesar Cipher is to use a string of valid characters and the remainder operator, %. char Encrypt_Via_Caesar_Cipher(char letter, unsigned int shift) { static const std::string vocabulary = “0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ”; const std::string::size_type position = vocabulary.find(letter); char c = letter; if (position != std::string::npos) { const std::string::size_type length = vocabulary.length(); c = vocabulary[(position … Read more