Update caesar-cipher.py

The code snippet for comparing value of new_shift greater than 25 is redundant, as already we are computing mod 26 of new_shift in the previous line, so, the value of new_shift will never be greater than 25.

Author: hiarijit

projects/caesar_cipher/caesar-cipher.py

@@ -42,8 +42,6 @@ def encrypt(text, shift):
                 if chosen_letter == letter:
                     new_shift = i + shift
                     new_shift = new_shift % 26
-                    if new_shift > 25:
-                        new_shift = new_shift - 24
                     position = alphabet[new_shift]
                     new_word.append(position)
                 i = i + 1
@@ -66,8 +64,6 @@ def decrypt(text, shift):
                 if chosen_letter == letter:
                     new_shift = i + shift
                     new_shift = new_shift % 26
-                    if new_shift > 25:
-                        new_shift = new_shift - 24
                     position = alphabet[new_shift]
                     new_word.append(position)
                 i = i + 1