gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(documentation): typo missing (#18537)

Browse Source 
Added missing dots at the end of sentences.
This commit is contained in:
Hafid Feghouli
2018-10-14 12:31:10 -04:00
committed by Quincy Larson
parent 911ffeb285
commit 0872c911ce
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
client/src/pages/guide/english/algorithms/divide-and-conquer-algorithms/index.md
View File

@ -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.