Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d9b4195

Browse files
d&c fixes
1 parent 711f84d commit d9b4195

File tree

1 file changed

+1
-3
lines changed

1 file changed

+1
-3
lines changed

‎book/chapters/divide-and-conquer--intro.adoc‎

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,9 +10,7 @@ We have already done some divide and conquer algorithms. This list will refresh
1010
- <<logarithmic-example, Binary Search>>: find a value in a sorted collection by *spliting* the data in half until it finds the value.
1111
- <<Getting all permutations of a word, Permutations>>: *Take out* the first element from the input and solve permutation for the reminder of the data recursively, then *join* results and append the elements that were take out.
1212
13-
We can solve algorithms using D&C algorithms using the following steps.
14-
15-
.Divide and conquer algorithms steps:
13+
.In general, the divide and conquer algorithms have the following receipe:
1614
1. *Divide* data into subproblems.
1715
2. *Conquer* each subproblem.
1816
3. *Combine* solutions.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /