From: "Geo" 

"John Beckett"  wrote
in message news:419f1666.28883121{at}216.144.1.254...

>     // In practice, call the library qsort function.

See now this is the part that really ticks me off, we were never shown a
library function called qsort or even a way to find out if one exists.
Seems to me library functions are one of the most useful features of C++
compared to other languages but they have shown us nothing about how to
take advantage of what's available. I can understand not showing us MFC but
they could have at least allowed us to use functions or classes we find on
the net.

And you are correct about it being confusing learning classes for the first
time. We are learning it as

class blah // declaration
{};
blah::blah() // implementation
{classvar=passedvar}
void blah::funct() // class functions {return;}

but what Gregg posted had all this in the public section which looked a
whole lot more understandable to me. Course I'm not allowed to do it that
way... So I'm questioning why they don't teach us the more elegant method?

Lastly what's wrong with a bubblesort for a beginner class (yeah I know you
high level programmer you )? Even beginners can understand how it
works as it does what's needed in the simplest way. Yes I know the
difference in efficiency between bubble and quick, but who's to decide
what's more efficient when we are talking about not only how fast it
operates but how fast you can code it?

http://math.hws.edu/TMCM/java/labs/xSortLabLab.html

I really like their demo, I used it to show my son how the different sorts
work. But it seems to me they missed one, I recall a selection sort where
it was selecting both min and max values during the same pass so it
finished in half the time of the one shown there?

Geo.

--- BBBS/NT v4.01 Flag-5