Final Exam hints - other practice options?

[Jesse Howell]

So the email we got from Rob basically said "Be able to code
Merge_Sort in Java from the pseudocode and/or the animation."
I don't know about the rest of you, but after solving a problem once,
it doesn't make much sense to "practice" the same problem. What I mean
is, I've already turned the merge sort pseudo into Java code. If I
were to try again from scratch, I wouldn't have to try to figure it
out again, and I'd already know where all the bugs were from last
time. It would be an unrealistic practice for the Final on Monday.

If you scroll down to the bottom of the Wiki page for Merge sort,
you'll find a ton of different sorting algorithms. If you're looking
for a new challenge to see how you'll hold up to something from
scratch (like the test will be), you can try a few other sorting
methods. Beware that some of them don't have pseudo code, some of
them don't have animations, and some of them DO have Java code already
written (don't cheat - it won't help on the test). So if you're like
me and writing the merge sort over and over again won't help, there
are a lot of sorting methods with pseudocode and animations on
Wikipedia if you're willing to give them a try.