Fixed titles, math rendering, and links on some pages

content/notes/algorithms/backtracking.md

@@ -1,4 +1,8 @@
-# Backtracking
+---
+title: Backtracking
+showthedate: false
+---
+
 This algorithm tries to construct a solution to a problem one piece at a time. Whenever the algorithm needs to decide between multiple alternatives to the part of the solution it *recursively* evaluates every option and chooses the best one.
 
 
@@ -59,4 +63,4 @@ ConstructSubset(X, i, T):
 
 Backtracking algorithms are used to make a *sequence of decisions*.
 
-When we design a new recursive backtracking algorithm, we must figure out in advance what information we will need about past decisions in the middle of the algorithm.
+When we design a new recursive backtracking algorithm, we must figure out in advance what information we will need about past decisions in the middle of the algorithm.

content/notes/algorithms/dynamic.md

@@ -1,4 +1,6 @@
-# Dynamic Programming
+---
+title: Dynamic Programming
+---
 
 The book first goes into talking about the complexity of the Fibonacci algorithm
 
@@ -79,4 +81,4 @@ These algorithms are best developed in two distinct stages.
 
 ## Greedy Algorithms
 
-If we're lucky we can just make decisions directly instead of solving any recursive subproblems. The problem is that greedly algorithms almost never work.
+If we're lucky we can just make decisions directly instead of solving any recursive subproblems. The problem is that greedly algorithms almost never work.

content/notes/algorithms/greedy.md

@@ -1,4 +1,7 @@
-# Greedy Algorithms
+---
+title: Greedy Algorithms
+showthedate: false
+---
 
 Greedy Algorithms are about making the best local choice and then blindly plowing ahead.
 
@@ -33,4 +36,4 @@ An unstable match is when
 The Gale-Shapley algorithm is a great greedy fit. It goes like this
 
 1. An arbitrary unmatched hospital A offers its position to the best doctor a who has not already rejected it.
-2. If a is unmatched, she tentatively accepts A's offer. If a already had a match but prefers A, she rejects her current match and tentatively accepts the new offer from A. Otherwise a rejects the new offer.
+2. If a is unmatched, she tentatively accepts A's offer. If a already had a match but prefers A, she rejects her current match and tentatively accepts the new offer from A. Otherwise a rejects the new offer.

content/notes/algorithms/recursion.md

@@ -1,4 +1,8 @@
-# Recursion
+---
+title: Recursion
+showthedate: false
+math: true
+---
 
 ## Reductions