this is for holding javascript data
Jeremy Ting renamed untitled.tex to q1.tex
almost 10 years ago
Commit id: ef02b00012d308cb1b31af5a51949859cac2648c
deletions | additions
diff --git a/q1.tex b/q1.tex
new file mode 100644
index 0000000..f8f99ac
--- /dev/null
+++ b/q1.tex
...
\section{Question #1}
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 their similarity level. If there is $n$ people, the number of connections will be on the order of $n^2$. From this, we can call the total number of connections, $E$.
Now, we can 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 integer (we know this because of how the problem is set up).
2. We must know the range of the numbers
