diff --git a/client/src/pages/guide/english/algorithms/divide-and-conquer-algorithms/index.md b/client/src/pages/guide/english/algorithms/divide-and-conquer-algorithms/index.md
index 007d19f0dd..eee7403ce0 100644
--- a/client/src/pages/guide/english/algorithms/divide-and-conquer-algorithms/index.md
+++ b/client/src/pages/guide/english/algorithms/divide-and-conquer-algorithms/index.md
@@ -8,8 +8,8 @@ Divide and Conquer |  (Introduction)
 Like Greedy and Dynamic Programming, Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three steps.
 
 1. Divide: Break the given problem into subproblems of same type.
-2. Conquer: Recursively solve these subproblems
-3. Combine: Appropriately combine the answers
+2. Conquer: Recursively solve these subproblems.
+3. Combine: Appropriately combine the answers.
 
 Following are some standard algorithms that are Divide and Conquer algorithms.