viewing issue

rbrox · rbrox · commit 00bf08bd5a14 · 2023-10-16T19:42:18.000+05:30
diff --git a/en/Sorting Algorithms/Merge Sort.md b/en/Sorting Algorithms/Merge Sort.md
@@ -18,12 +18,10 @@ Average - O(n log n)
 Worst case - O(n log n)
 ```
 
-The time complexity can be obtained by solving the below recurrance relation
-\begin{equation*}
-\begin{aligned}
-T(n) = 2T\left(\frac{n}{2}\right) + An
-\end{aligned}
-\end{equation*}
+The time complexity can be obtained by solving the below recurrence relation:
+
+$$T(n) = 2T\left(\frac{n}{2}\right) + An$$
+
 
 
 #### Space Complexity
