README-en.md edited online with Bitbucket

README-en.md

@@ -63,7 +63,7 @@ The Caesar Cypher is a substitution encryption technique that is said to have be
 
 ---
 
-###Using the modulo operator
+###Using the Modulo Operator
 
 Modular addition is essential for implementing ciphering systems in programming. In the Caesar Cypher application above we could think that every letter of the (English) alphabet is assigned a number between 0 and 25 (‘A’ is 0, ‘B’ is 1, .., ‘Z’ is 25). The Caesar Cypher transforms every letter we convert to its corresponding number in the range [0,25], then add the displacement. To do the cyclic displacement, every time our displacement gives us a letter that corresponds to a number greater than 25, we take the remainder of the number divided by 26 and use the letter that corresponds to the remainder. Note that taking the remainder by dividing the number by 26 gives us results that will be between 0 and 25, which are the values associated with the alphabet. 
 
@@ -90,7 +90,7 @@ Figure 3 shows the pseudocode of an algorithm for the Caesar cypher. Each letter
     3. return cypheredText 
 ```
 
-**Figure 3.** Pseudocode for a Caesar cypher algorithm.
+**Figure 3.** Pseudocode for a Caesar Cypher Algorithm.
 
 ---
 
@@ -173,7 +173,7 @@ We will also use the following functions:
 ---
 
 
-## Laboratory session:
+## Laboratory Session:
 
 You will be completing an application to cypher a message using the Vigenere technique. To simplify coding, the keyword and clear text must consist exclusively of letters. Furthermore, your program must change both the cleartext and keyword to uppercase before ciphering.