Hi section 4.

This is our second and last contest/challenge.
The competition was announced some time ago and I am only releasing
it now, hoping that you have more time for this now (then again
I may be wrong).
The competition runs from now until Friday morning, and the first accurate
entry will win a prize announced in class on Friday.

The contest is testing your understanding of complexity
analysis. You are given two versions of quicksort (quicksort1 and
quicksort2). You need to say which algorithm is slower and give 
the Big Oh complexity of both as a function of n (the input array size).
Please comment on best and worst cases for each of the two algorithms.

The code for quicksort1 and quicksort2 has been posted on my LECTURE 
page of ECE106 as the last entry (Contest2.tar.gz).

On an unrelated note, I wish to thank the people who took the
time to complete the midterm course and instructor evaluation. 
Unfortunately I need to ask you to submit your evaluation again. 
Only the final evaluation, the one that runs now, is official 
and goes to the head of the Department, etc. The midterm one was only 
as direct feedback to me. Anyone who has not submitted a midterm evaluation, 
but feels that they know me well enough to make a useful judgement, 
I would encourage them to provide feedback as well. 

Finally, for the people who expressed the need for help
with installation/usage of Visual C++, I suggest you go to the lab on Friday
and the TA (Gokul Soundararajan) will help you with this and potentially
demo stuff for you - on a desktop somewhere since the lab only runs Linux. 
If you need specific howto handouts or need this sooner
please contact me or the TA directly with your specific need.
Gokul Soundararajan will also provide any help needed and answers to  
any questions on your project during my Monday's tutorial 11-12 p.m. in
Haultain 401. You can ask him any questions on hash tables or complexity
during that tutorial as well. Since he's also my research assistant,
if he can't answer any of your questions please let me know :-).

-Cristiana