Skip to content

Commit

Permalink
📝 improves mergesortree with math symbols
Browse files Browse the repository at this point in the history
  • Loading branch information
iagorrr committed Dec 28, 2023
1 parent 549da28 commit 5fc2c45
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion algorithms/data-structures/merge-sort-tree.tex
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@ \subsection{Merge Sort Tree}


\begin{itemize}
\item \textbf{$inrange(l, r, a, b)$} : counts the number of elements $x$ in the subarray $[l, r]$ such that $ a <= x <= b$.
\item \textbf{$inrange(l, r, a, b)$} : counts the number of elements $x \in [l, r]$ such that $ a \leq x \leq b$.
\end{itemize}

Memory: $O(n \log{N})$
Expand Down

0 comments on commit 5fc2c45

Please sign in to comment.