deletions | additions       diff --git a/Complexity analysis.tex b/Complexity analysis.tex  index 9cb1a82..a224b05 100644  --- a/Complexity analysis.tex  +++ b/Complexity analysis.tex 
...
T(n) = R(n) + k_0 + k_1 n + k_2 n \log n  \]  This means that if, $R(n) \in O(n \log n)$, then $T(n) \in O(n \log n)$ as well. If not, then $T(n) \in O(R(n))$. Thus, if we can find $R$ in $O(n \log n)$, then our solution is $O(n \log n)$.