README-en.md edited on August 3, 2016 at 1:35pm

README-en.md

-#Repetition Structures - Game of sticks
+# Repetition Structures - Game of Sticks
 
 ![main1.png](images/main1.png)
 ![main2.png](images/main2.png)
 ![main3.png](images/main3.png)
 
-One of the advantages of using computer programs is that we can easily implement repetitive tasks. Structures such as the `for`, `while`, and `do-while` allow us to repeat a block of instructions as many times as needed. These structures are also known as *repetition structures*. In today’s laboratory experience you will practice the use of loops to implement a game of sticks in C++.
 
-##Objectives:
+[verano2016 - Coralys]
 
-Design algorithms to realize a task.
-Translate an algorithm into pseudocode.
-Implement a complete program.
-Practice the use of repetition structures.
+One of the advantages of using computer programs is that we can easily implement repetitive tasks. Structures such as the `for`, `while`, and `do-while` allow us to repeat a block of instructions as many times as needed. These structures are also known as *repetition structures*. In today’s laboratory experience, you will practice the use of loops to implement a game of sticks in C++.
 
-This laboratory experience is an adaptation of the exercise found in:
-http://nifty.stanford.edu/2014/laaksonen-vihavainen-game-of-sticks/handout.html.
+## Objectives:
 
-##Pre-Lab
+1. Design algorithms to realize a task.
+2. Translate an algorithm into pseudocode.
+3. Implement a complete program.
+4. Practice the use of repetition structures.
+
+This laboratory experience is an adaptation of the exercise found in: http://nifty.stanford.edu/2014/laaksonen-vihavainen-game-of-sticks/handout.html.
+
+## Pre-Lab:
 
 Before coming to the laboratory session you should have:
 
-Reviewed the basic concepts related to repetition structures.
+1. Reviewed the basic concepts related to repetition structures.
 
 2. Studied the concepts and instructions for the laboratory session.
 
 
 For example, a game of sticks could go like this:
 
-*  The game starts with 20 sticks on the table.
+* The game starts with 20 sticks on the table.
 * Aurora takes 3 sticks, there are 17 left.
 * Bruno takes 2 sticks, there are 15 left.
 * Aurora takes 1 stick, there are 14 left.
 ---
 
 
-## Laboratory Session
+## Laboratory Session:
 
 In today’s laboratory experience you will practice the use of loops to implement a game of sticks.
 
-### Exercise 1: Design the algorithm
+### Exercise 1 - Design the Algorithm
 
 Design an algorithm so that two people can play the game of sticks on the computer. The algorithm should have these restrictions:
 
-At the beginning, it should ask the number of sticks there will be on the table. The range of accepted numbers is [10, 100]. If the user enters a number outside of this range, the program will continue asking.
+1. At the beginning, it should ask the number of sticks that will be on the table. The range of accepted numbers is [10, 100]. If the user enters a number outside of this range, the program will continue asking.
 
-In each turn, the player will be allowed to take from 1 to 3 sticks (without exceeding the number of available sticks on the table). If the user enters a number outside of this range, the program will continue asking.
+2. In each turn, the player will be allowed to take from 1 to 3 sticks (without exceeding the number of available sticks on the table). If the user enters a number outside of this range, the program will continue asking.
 
-When the game ends, the program should say who the winner is.
+3. When the game ends, the program should say who the winner is.
 
-**Example**
+**Example:**
 
 ```
 Welcome to the game of sticks!
 You lose, Player 1 :-(
 ```
 
-###Exercise 2: Write the pseudocode
+### Exercise 2 - Write the Pseudocode
 
-#### Instructions:
+#### Instructions
 
 1. Close the computer.
 
 3. Execute the pseudocode by hand to capture logical errors. Try it with various *extreme* cases and write the results by hand. [Here](https://docs.google.com/a/upr.edu/presentation/d/1m-lXCUTKhCZC8vTnmtAXwfxQjIKkSVhTUrcywiZsdbQ/edit?usp=sharing) you can see an example of how to hand check an algorithm.
 
 
-###Exercise 3: Implement the code
+### Exercise 3 - Implement the Code
 
-#### Instructions: 
+#### Instructions 
 
 1. Open the computer.
 
 2. Implement the algorithm in a C++ program.
 
-**Help**
+**Help:**
 
-1) Use the `int` type variable to keep track of the player. At the end of each turn, change the player like this: 
+1) Use an `int` type variable to keep track of the player. At the end of each turn, change the player like this: 
 
    ```cpp
    player = player == 1 ? 2 : 1;
 
    c. How is the loop control variable modified during each iteration?
 
-###Deliverables: 
+### Deliverables 
 
-Use “Deliverables 1” in Moodle to hand in the pseudocode for the game of sticks.
+1. Use “Deliverables 1” in Moodle to turn in the pseudocode for the game of sticks.
 
-2. Use “Deliverables 2” in Moodle to hand in the paper where you and your partner executed the pseudocode by hand. 
+2. Use “Deliverables 2” in Moodle to turn in the paper where you and your partner executed the pseudocode by hand. 
 
-3. Use “Deliverables 3” in Moodle to hand in a `.cpp` file with the C++ program to play the game of sticks. The program should not have compiler errors, should be documented and function as intended. Remember to use good programming techniques, include the name of the programmers and document your program.
+3. Use “Deliverables 3” in Moodle to turn in a `.cpp` file with the C++ program to play the game of sticks. The program should not have compiler errors, should be documented and function as intended. Remember to use good programming techniques, include the name of the programmers, and document your program.