this is for holding javascript data
Jeremy Ting added q2.tex
about 10 years ago
Commit id: 1f4f3813245115bc95a15fdabf1fdd8fc6754418
deletions | additions
diff --git a/q2.tex b/q2.tex
new file mode 100644
index 0000000..2408c91
--- /dev/null
+++ b/q2.tex
...
\section{Question 2}
\begin{enumerate}
\item
2a
\item
We will first take one person and have him/her interview for ách job position. After the interviews, then we split the job positions into the 3 categories: 1 - jobs that he can do, 2 - jobs that he can't do, and 3 - jobs that perfectly match him (???).
Then, we take the other candidates and have them interview for the perfectly matched job (3), and split them into two groups 3 - jobs that they can do, and 4 - jobs that they can't do.
Now, we pair the groups 3 and 2 and pair the groups 1 and 4 (with the numbers designated to the above).
People that could handle the perfect job (3) will have to do the more difficult jobs that is group 2. People that couldn't handle the perfect job (4) will do the easier jobs in group (1).
To sort everyone out, we will use quicksort, which has an average case of $nlogn$.
\emd{enumerate}
