From: "Paul Ranson" 

ISTM that the C++ 'sort' is rather simpler to use than the C 'qsort'.

int a [ 5 ] ;
a [ 0 ] = 5 ;
a [ 0 ] = 5 ;
a [ 0 ] = 5 ;
a [ 0 ] = 5 ;
a [ 0 ] = 5 ;

 wrote in message
news:v2b2q0t1vjuba0k7sfice2r91p2vtgtheu{at}4ax.com...
> On Sun, 21 Nov 2004 10:41:13 -0500, "Geo"
 wrote:
>>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.
>
> I was a bit nervous referring to qsort because, as Paul and Gregg have
> pointed out, a C++ programmer is supposed to use more sophisticated
> methods.
>
> In my example, the program was given an array of integers and needed
> to sort them. Calling qsort is the way to go. A more generic app would
> be dealing with classes rather than integers. In that case, you are
> supposed to add all the correct features to the class so that the
> standard template sort routine will work. An example of a "correct
> feature" would be an operator that  determines whether one instance of
> a class is less than another.
>
> The reason your teacher hasn't mentioned qsort or STL sort is that
> they are REALLY weird for a beginner - you don't have time. Given an
> example, they are trivial. However, understanding them enough so you
> can use them only comes after quite a bit of C++ (or C for qsort)
> experience, IMHO.

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