1) Your friend says he has found a sorting algorithm that

sorts in much less than W(n) = Theta(N^2) comparisons even though it corrects

only one bad pair per comparison. Please teach him why he is wrong.

*Answer:

2) Your friend says he has found a sorting algorithm that

sorts in much less than W(n) = Theta(N^2) comparisons even though it corrects

only one bad pair per comparison. Please teach him why he is wrong.

*Answer:

3)

Describe 2 Space vs. Time decision cases we discussed in this class.

In what ways can each be called Space vs. Time?

*Name Example Algorithms: __Quick______ vs.___Merge___________

*Reason: // need help with the reason

*Name Example Data Structures: __vector_______vs.___array_________

*Reason: // need help with the reason