Re: About 30 chapters on C++ doubts

On 9 Jun., 15:14, "parag_p...@hotmail.com" <parag_p...@hotmail.com>
wrote:


The first entry I took was item 20, which had item #93 as its first
item:

93. Why qsort is Still Useful in C++
C++ defines a set of generic algorithms such as sort and find.
However, the corresponding C algorithms, qsort and bsearch, are still
useful in C++ programs for at least three reasons:
=95 Legacy code. Familiarity with C algorithms is needed to maintain
legacy C code.
[you had that one right]

=95 Efficiency. You cannot apply STL algorithms to items that are not
stored in an STL container. [ wrong! ]
To apply these algorithms to a built-in array, you first have to copy
it into a container [ wrong! ]
--an operation that incurs runtime overhead.
=95 Applicability to non-OO data types. STL algorithms rely on operators
== and >.
[ wrong! ]
However, these operators are either meaningless or not defined when
applied to plain structs or built-in arrays. C algorithms do not rely
on these operators to work.

So for that one item you had three wrongs and one right.
I hope you remove those pages - a beginner might find them and believe
you.

/Peter