diff --git a/README.md b/README.md
index 97bae5a..e464ee4 100644
--- a/README.md
+++ b/README.md
@@ -15,13 +15,10 @@ sorted list. These transformations provide opportunities to increase redundancy
 for improved robustness and can be leveraged to include any further processing
 we wish to do on the elements.
 
-
       
 
-
-
 <figure>
-    <img src="./assets/images/deck_shuffle_chart_censored.svg "
+    <img src="./assets/images/deck_shuffle_chart_censored.svg"
          alt="When sorting a randomly shuffled deck of cards, Quicksort makes
         202 positional errors, Mergesort makes 201, Bubblesort makes 4, Tensort
         makes 51, Mundane Robustsort makes 11, and Magic Robustsort makes
@@ -34,6 +31,8 @@ we wish to do on the elements.
     </i></figcaption>
 </figure>
 
+      
+
 ## Table of Contents
 
 - [Introduction](#introduction)
@@ -165,6 +164,8 @@ processing tailored to suit the current goals while preserving time efficiency.
 as strict dependency management, which even the smartest among us sometimes
 falter without:
 
+      
+
 <figure>
     <img src="./assets/images/ackley_deps.png"
          alt="Comment from Ackley in the Beyond Efficiency code about Perl
@@ -234,6 +235,8 @@ and re-read the paper!
 
 Alright, let's get started! Ready, Sir Michael?
 
+      
+
 <figure>
     <img src="https://m.media-amazon.com/images/M/MV5BMzU2Nzk5NjA1M15BMl5BanBnXkFtZTYwNjcyNDU2._V1_.jpg"
          alt="Sir Michael Caine, ready to go!">
@@ -508,6 +511,8 @@ pretty happy with that!
 But now that we understand Tensort's basic structure, let's tune it for even
 more robustness!
 
+      
+
 <figure>
     <img src="https://m.media-amazon.com/images/M/MV5BNjk2MTMzNTA4MF5BMl5BanBnXkFtZTcwMTM0OTk1Mw@@._V1_.jpg"
          alt="Michael Caine sitting at a desk in front of a chalkboard full of
@@ -695,7 +700,6 @@ of both accuracy in determining the TopBit and adhering to the general rules of
 this project while returning something besides [1,3,2] as its third most common
 result, [I'd love to hear about it](#contact)!
 
-
       
 
 <figure>
@@ -822,6 +826,8 @@ You'll remember that our standard Tensort uses a logarithmic Bytesize. Our base
 Robustsort uses a Bytesize of 3, but we can use a logarithmic Bytesize by
 adding recursion.
 
+      
+
 <figure>
     <img src="https://m.media-amazon.com/images/M/MV5BZWUzM2NhMTMtM2U0Yy00MmE4LWI2OGItMWQyZjQ3MmRkMGVlXkEyXkFqcGdeQXVyNTAyODkwOQ@@._V1_.jpg"
          alt="Michael Caine reaching into a cage to gently retrieve a bird. The
@@ -833,7 +839,6 @@ adding recursion.
         </a></i></figcaption>
 </figure>
 
-
       
 
 Let's take our base Robustsort example above and make it recursive.
@@ -874,6 +879,8 @@ Magicsort is an algorithm that will re-run Permutationsort only if it disagrees
 with an extremely reliable, theoretically non-deterministic algorithm - one
 that's so good it's robust against logic itself...
 
+      
+
 <figure>
     <img src="./assets/images/mc_confused.png"
          alt="Michael Caine and Mike Meyers looking taken aback">
@@ -882,10 +889,8 @@ that's so good it's robust against logic itself...
         </a></i></figcaption>
 </figure>
 
-
       
 
-
 ...[Bogosort!](https://www.youtube.com/watch?v=kgBjXUE_Nwc&t=583)
 
 Magicsort simply runs both Permutationsort and Bogosort on the same input and
@@ -994,11 +999,8 @@ considerations to keep in mind:
 Now let's take a look at how everything compares. Here is a graph showing the
 benchmarking results for average error score for our algorithms:
 
-
       
 
-
-
 <figure>
     <img src="./assets/images/deck_shuffle_chart_uncensored.svg"
          alt="When sorting a randomly shuffled deck of cards, Quicksort makes
@@ -1006,6 +1008,8 @@ benchmarking results for average error score for our algorithms:
         makes 51, Mundane Robustsort makes 11, and Magic Robustsort makes 1">
 </figure>
 
+      
+
 As shown above, when sorting a randomly shuffled deck of cards, Quicksort makes
 202 positional errors, Mergesort makes 201, Bubblesort makes 4, Logarithmic
 Tensort makes 51, Basic Mundane Robustsort with Bogosort adjudicator makes 11,
@@ -1038,9 +1042,13 @@ information):
      RobustsortRM | 0.249211013s    | 1824     |
     ----------------------------------------------------------
 
+      
+
 Well, there it is! I'm pretty happy with the results. What do you think, Sir
 Michael?
 
+      
+
 <figure>
     <img src="./assets/images/mc_doors.png"
          alt="Michael Caine looking upset with Michael Standing">
@@ -1049,6 +1057,8 @@ Michael?
         </a></i></figcaption>
 </figure>
 
+      
+
 ## Library
 
 This package provides implementations of the following algorithms wrapped for