deletions | additions       diff --git a/We_take_textbf_Step_1__.tex b/We_take_textbf_Step_1__.tex  index b5efe04..72b074a 100644  --- a/We_take_textbf_Step_1__.tex  +++ b/We_take_textbf_Step_1__.tex 
...
\end{itemize}  Putting this all together, the running time of our recursive algorithm given an input size $n$ is $R\left(n\right) := =  O\left(n\right) + 2R\left(\frac{n}{2}\right)$. \begin{claim}  $R\left(n\right)$ runs in $O\left(n\log n\right)$