viewing issue

TheAlgorithms · Oct 16, 2023 · 00bf08b · 00bf08b
1 parent 09574cb
commit 00bf08b
Showing 1 changed file with 4 additions and 6 deletions.
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