On Jun 24, 8:43 am, John Harrison <john_androni...@hotmail.comwrote:
Shraddha wrote:
On which of the following we cannot perform max. operations?
1. Array
2. Hash Table
3. Linked List
4. Heap
5. Bianry Tree
My answer would be 'none of them'. They are all collections, so they all
have a maximum element. On some of them it will be easier to find the
maximum element than others.
All of them, or none of them. They are all collections, and we
don't know what they contain. If what they contain doesn't
support ordering, max doesn't even have a meaning.
But really it depends on what you mean by 'max. operations'.
An interesting example is std::set< complex< double >, MyCmp >.
The user defines an arbitrary ordering, because std::set (a
binary tree, normally) requires one, but any relationship with
what a normal user would consider "max" is totally arbitrary.
Since this group is concerned with C++ (and not algorithms and
data structures), I suppose that the correct answer would be
that the algorithme std::max_element can be called on any
containter which provides forward iterators, provided, of
course, that either the value_type supports the operator<. or
that you provide a compatible comparison function for the
value_type. (Which is, of course, just what you said, couched
in C++'ese.)
--
James Kanze (Gabi Software) email:
ja*********@gmail.com
Conseils en informatique orientée objet/
Beratung in objektorientierter Datenverarbeitung
9 place Sémard, 78210 St.-Cyr-l'École, France, +33 (0)1 30 23 00 34
