maggicl/DSA
Archived
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Fixed GA3 latex

Browse source
This commit is contained in:
Claudio Maggioni 2019-05-10 12:08:21 +02:00
parent 3876eb5208
commit 4bca4b25ac
2 changed files with 6 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

BIN
GA3/ga3.pdf
View file

Binary file not shown.

9
GA3/ga3.tex
View file

@ -8,6 +8,7 @@
\title{Graded Assignment 3 -- DSA} \title{Graded Assignment 3 -- DSA}
\author{Claudio Maggioni} \author{Claudio Maggioni}
\setlength{\parindent}{0cm}
% listings configuration % listings configuration
\lstset{ \lstset{
@ -354,8 +355,10 @@ Insert 2:
10R 12B 15B 10R 12B 15B
/ /
14R 14R
\end{verbatim} \end{verbatim}%
} }%
%
Assume every empty branch has as a child a black leaf node.
\subsection{Point B} \subsection{Point B}
@ -394,7 +397,7 @@ FUNCTION JOIN-INTERVALS(X)
n $\gets$ n + 1 n $\gets$ n + 1
X.length $\gets$ 2 * n X.length $\gets$ 2 * n
\end{lstlisting} \end{lstlisting}
\\ %
The complexity of this algorithm is $O(n\log(n))$ since the sorting is in $\Theta(n\log(n))$ and the The complexity of this algorithm is $O(n\log(n))$ since the sorting is in $\Theta(n\log(n))$ and the
union operation afterwards is $\Theta(n)$. union operation afterwards is $\Theta(n)$.