deletions | additions       diff --git a/untitled.tex b/untitled.tex  index a2e0039..f8f99ac 100644  --- a/untitled.tex  +++ b/untitled.tex 
...
\textit{Oh, an empty article!} \section{Question #1}  You can get started by \textbf{double clicking} this text block A. First, we will put all of the $S(u_i,u_j)$ values into an array that keeps track of the two people  and begin editing. You their similarity level. If there is $n$ people, the number of connections will be on the order of $n^2$. From this, we  can also click call  the \textbf{Insert} button below to add new block elements. Or you total number of connections, $E$.   Now, we  can \textbf{drag and drop use counting sort to sort all of these values from the largest to smallest. TO use ocunting sort, we have to make sure these two assumptions are satisfied first.  1. The values must be  an image} right onto integer (we know  this text. Happy writing! because of how the problem is set up).  2. We must know the range of the numbers