diff --git a/exhaustive-search.md b/exhaustive-search.md
index 51e9d5cc14ebc9f7256e52d41c862fa2b51bce55..983318e06dd4d4c0fb4bf8257baff2f97bfc6eb2 100644
--- a/exhaustive-search.md
+++ b/exhaustive-search.md
@@ -67,8 +67,9 @@ function color(graph) {
 
 ### Subproblem
 
-Subproblem: Given an undirected graph and a coloring of its vertices, determine
-whether the coloring is proper (no adjacent vertices share a color).
+Subproblem: Given an undirected graph and a coloring of its vertices,
+determine whether the coloring is proper (no adjacent vertices share a
+color).
 
 #### Contract
 
@@ -125,9 +126,9 @@ function knapsack(items, getWeight, weightLimit, getValue) {
 
 ### Subproblem
 
-Subproblem: Given a universe of items, a function to compute the weights of sets
-of items, and a weight limit, find the set of all sets of items not exceeding
-the weight limit.
+Subproblem: Given a universe of items, a function to compute the
+weights of sets of items, and a weight limit, find the set of all sets
+of items not exceeding the weight limit.
 
 #### Contract