From: sto.mar@...
Date: 2013-07-28T20:36:42+09:00
Subject: Re: Working through Ch.10 for learning to program 2.0 (Chris Pine)

Am 28.07.2013 11:15, schrieb JD JD:
> However, he doesn't go over algorithms.

That's not true. He essentially describes "selection sort"
right on page 75:

  "We'll take our list of words, find the 'smallest' word [...]
   and stick it at the end of the already-sorted list. All of the
   other words go into the still-unsorted list. Then you do the
   same thing again [...ample omissions...] until your
   still-unsorted list is empty."

That's the algorithm!

You might also want to search for selection sort in the internet,
it's one of the easiest sorting algorithms you could conceive.

> I haven't done the non recursive one either.  I was going to try to do 
> recursive first, but got so frustrated that I stopped.

You really should start with the iterative version.

Regards,
Marcus


-- 
GitHub: https://github.com/stomar/
PGP:    0x6B3A101A