diff --git a/_posts/2019-05-22-sorting.md b/_posts/2019-05-22-sorting.md
index c6b8d8cd..6fedd682 100644
--- a/_posts/2019-05-22-sorting.md
+++ b/_posts/2019-05-22-sorting.md
@@ -8,7 +8,7 @@ image: /assets/2019-05-22/og-image.jpg
 assets: /assets/2019-05-22
 code: https://github.com/travisdowns/sort-bench/blob/master
 excerpt: Building sort functions faster than what the C and C++ standard libraries offer.
-content_classes: invert-img
+content_classes: invert-img axe-hack
 ---
 
 Recently, Daniel Lemire [tackled the topic](https://lemire.me/blog/2019/05/07/almost-picking-n-distinct-numbers-at-random/) of selecting N _distinct_ numbers at random. In the case we want sorted output, an obvious solution presents itself: sorting randomly chosen values and de-duplicating the list, which is easy since identical values are now adjacent.[^distinct]
diff --git a/_sass/minima/custom-styles.scss b/_sass/minima/custom-styles.scss
index 3e492227..1d5f30f3 100644
--- a/_sass/minima/custom-styles.scss
+++ b/_sass/minima/custom-styles.scss
@@ -115,9 +115,14 @@ sup[id^='fnref'] {
   border-radius:10%;
 }
 
-// work around
+// workaround for
 // https://github.com/jekyll/minima/issues/604
 pre,
 code {
   @include relative-font-size(0.9375);
 }
+
+// workaround for https://github.com/travisdowns/travisdowns.github.io/issues/449
+.axe-hack pre > code {
+    display: block;
+}