From 62f546c6906e790a240c0d9d2e7aef4475f4d0e9 Mon Sep 17 00:00:00 2001 From: Edward Brey Date: Fri, 25 Dec 2020 11:34:46 -0600 Subject: [PATCH] Fix heading rendering --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 8059942..ada1a1e 100644 --- a/README.md +++ b/README.md @@ -11,7 +11,7 @@ I am the only developer on the project so I can do it my way. * **Appropriate Efficiency:** Code is optimized where it **needs** to be optimized. Let's be honest. This is C#. I can't compete with C++, but more and more people are using high-level languages for data-science. When an optimization can drastically improve performance (e.g., using k-d-trees, multi-threading) I optimize. When optimization complicates the code for a 1% speed increase, I don't. -###Algorithms +### Algorithms Here is a list of currently supported algorithms: * [k-NN](https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm)