You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: book/chapters/divide-and-conquer--intro.adoc
+1-3Lines changed: 1 addition & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -10,9 +10,7 @@ We have already done some divide and conquer algorithms. This list will refresh
10
10
- <<logarithmic-example, Binary Search>>: find a value in a sorted collection by *spliting* the data in half until it finds the value.
11
11
- <<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.
12
12
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:
0 commit comments