Hi,
and thank you for the notes on Problem 5. Despite
all the emails about it, though, I'm still utterly
clueless about the main part of the problem. I just
don't see how we go from an Insertion Sort to
generating the java code. I guess to start I should
understand how this "insertion sort" algorithm is
supposed to generate all possibilities. I mean, if we
have, for instance, n=4, the array a[] would be
{a,b,c,d}. But these are ALREADY sorted (a is less
than b, which is less than c, etc), so how does
insertion sort help? Wouldn't it just generate a tree
like this?
a
\
ab
\
abc
\
abcd
I know this is probably a very stupid question, I just
really don't see how this is supposed to work...
Thanks!
--Alex
__________________________________________________
Do You Yahoo!?
Yahoo! Movies - coverage of the 74th Academy Awards�
http://movies.yahoo.com/
