deletions | additions       diff --git a/pseudocode.tex b/pseudocode.tex  index 91ba789..9d9f5ff 100644  --- a/pseudocode.tex  +++ b/pseudocode.tex 
...
We'll first assume that we have access to the following constant time subroutines:  \begin{algorithm} \begin{algorithm}[H]  \caption{Finds the minimum angle needed for a ray originating in $O$ to intersect a circle $C$. To be consistent with maxIntersectionAngle(), the angle of a ray originating in $O$ and passing through the center of $C$ is defined to lie in the interval $[0, 2\pi]$. This means that the value returned by this function may be negative, but never greater than $2\pi$.)  \label{alg:minIntersectionAngle}}  \begin{algorithmic}[1] 
...
\end{algorithm}  \begin{algorithm} \begin{algorithm}[H]  \caption{Finds the maximum angle needed for a ray originating in $O$ to intersect a circle $C$. To be consistent with minIntersectionAngle(), the angle of a ray originating in O and passing through the center of $C$ is defined to lie in the interval $[0, 2\pi]$. This means that the value returned by this function may be greater then $2\pi$, but never negative.)  \label{alg:minIntersectionAngle}}  \begin{algorithmic}[1] 
...
\subsection{Abstract pseudocode}  \begin{algorithm} \begin{algorithm}[H]  \caption{Finds the minimum amount of rays needed to intersect circles from the point of origin (Abstract pseudocode) \textbf{(Abstract pseudocode)}  \label{alg:minRaysIntersecting}}  \begin{algorithmic}[1]  \Statex 
...
\subsection{More detailed version}  \begin{algorithm} \begin{algorithm}[H]  \caption{Finds the minimum amount of rays needed to intersect circles from the point of origin (More \textbf{(More  detailed version) version)}  \label{alg:minRaysIntersecting}}  \begin{algorithmic}[1]  \Statex