diff --git a/static/linkmap b/static/linkmap
index 09a1d9a..7fa4cfc 100644
--- a/static/linkmap
+++ b/static/linkmap
@@ -1,52 +1,52 @@
-/blog/activity-selection-huffman-encoding/index.{html} /blog/activity-selection-huffman-encoding/
-/blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/
-/blog/derivatives-options/index.{html} /blog/derivatives-options/
+/blog/a-c-programmer-s-guide-to-c/index.{html} /blog/a-c-programmer-s-guide-to-c/
+/blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/
 /blog/church-turing-hypothesis/index.{html} /blog/church-turing-hypothesis/
+/blog/flynn-s-taxonomy/index.{html} /blog/flynn-s-taxonomy/
+/blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/
+/blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/
+/blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/
+/blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/
 /blog/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/
-/blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/index.{html} /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/
-/blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/
+/blog/knapsack-using-branch-and-bounding/index.{html} /blog/knapsack-using-branch-and-bounding/
+/blog/network-flow-algorithms-ford-fulkerson/index.{html} /blog/network-flow-algorithms-ford-fulkerson/
+/blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/
 /blog/smart-pointers/index.{html} /blog/smart-pointers/
-/interests/index.{html} /interests/
-/blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/
-/blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/
-/blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/
-/blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/index.{html} /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/
+/blog/technical-analysis/index.{html} /blog/technical-analysis/
+/blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/
 /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/index.{html} /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/
-/blog/p-vs-np/index.{html} /blog/p-vs-np/
-/blog/profiling-a-program/index.{html} /blog/profiling-a-program/
-/blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/
+/blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/
+/interests/index.{html} /interests/
 /blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/
-/blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/
-/blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/
-/blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/
-/blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/index.{html} /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/
-/index.html /
-/blog/a-c-programmer-s-guide-to-c/index.{html} /blog/a-c-programmer-s-guide-to-c/
 /blog/extended-euclidean-algorithm/index.{html} /blog/extended-euclidean-algorithm/
-/blog/flynn-s-taxonomy/index.{html} /blog/flynn-s-taxonomy/
-/blog/knapsack-using-branch-and-bounding/index.{html} /blog/knapsack-using-branch-and-bounding/
-/blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/
-/blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/
-/blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/
-/blog/dna-sequencing/index.{html} /blog/dna-sequencing/
-/blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/index.{html} /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/
-/blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/
 /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/index.{html} /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/
-/blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/
-/blog/stock-multiples/index.{html} /blog/stock-multiples/
-/blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/
+/blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/
 /blog/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/
-/blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/
-/blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/
-/blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/
+/blog/booyer-moore-knuth-morris-pratt-for-exact-matching/index.{html} /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/
+/blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/index.{html} /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/
+/blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/index.{html} /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/
+/blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/
 /blog/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/
 /blog/vectorization-analyzing-loop-dependencies/index.{html} /blog/vectorization-analyzing-loop-dependencies/
-/blog/booyer-moore-knuth-morris-pratt-for-exact-matching/index.{html} /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/
+/blog/activity-selection-huffman-encoding/index.{html} /blog/activity-selection-huffman-encoding/
 /blog/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/
-/blog/complexity-theory-reductions/index.{html} /blog/complexity-theory-reductions/
-/blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/
-/blog/network-flow-algorithms-ford-fulkerson/index.{html} /blog/network-flow-algorithms-ford-fulkerson/
+/blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/index.{html} /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/
 /blog/new-and-delete/index.{html} /blog/new-and-delete/
-/blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/
-/blog/technical-analysis/index.{html} /blog/technical-analysis/
+/blog/p-vs-np/index.{html} /blog/p-vs-np/
+/blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/
 /blog/what-is-the-stock-market/index.{html} /blog/what-is-the-stock-market/
+/index.html /
+/blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/
+/blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/
+/blog/complexity-theory-reductions/index.{html} /blog/complexity-theory-reductions/
+/blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/
+/blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/
+/blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/
+/blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/
+/blog/stock-multiples/index.{html} /blog/stock-multiples/
+/blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/index.{html} /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/
+/blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/
+/blog/derivatives-options/index.{html} /blog/derivatives-options/
+/blog/dna-sequencing/index.{html} /blog/dna-sequencing/
+/blog/profiling-a-program/index.{html} /blog/profiling-a-program/
+/blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/
+/blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/
diff --git a/themes/obsidian-hugo-texify3 b/themes/obsidian-hugo-texify3
index 5a682df..3b6197a 160000
--- a/themes/obsidian-hugo-texify3
+++ b/themes/obsidian-hugo-texify3
@@ -1 +1 @@
-Subproject commit 5a682df8be82140372340a522cdfdcf0f2c8315f
+Subproject commit 3b6197a9062e49c41a07752d31df822537309751