fix(documentation): typo missing (#18537)
Added missing dots at the end of sentences.pull/18542/merge
parent
911ffeb285
commit
0872c911ce
|
@ -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.
|
||||
|
||||
|
|
Loading…
Reference in New Issue