what is an algorithm in terms of STL?
- 1 Answers
- 7468 Views
- Lucent, Wipro, I also Faced
- E-Mail Answers
Answer / bayo
In STL algorithms provide a set of functions to modify,
interpret and analyze the data in container objects.
Iterators provide the connection between the
containers and the algorithms. The generic algorithms take
iterators as arguments to access data in container
objects. Since they work on iterators, they have
independence from the container type.
| Is This Answer Correct ? | 4 Yes | 0 No |
if x<>=z then statement end what is the cyclomatic complexity
In what cases using of a 'template' is a better approach then using of a 'base class'?
6 Answers Lucent, Mind Tree, Wipro,
why does the execution of a c++ program start with main()???
Is there any error below, its a code to delete all entires from a map #include <map> #include iostream.h int main() { int i =0; map <int, char> TestMap; while(i<3) { TesMap.insert(TestMap::value_type(i,Test)); i++; } typedef map<int, char> :: iterator mapIter =TestMap.begin(); if(mapIter!=TestMap.end()) { TestMap.erase(mapItrer); ++mapIter; } return 0; }
When did c++ add stl?
What is the underlying datastructure of map?
What is the stl, standard template library?
What is Constructor
What is meant by stl in c++?
what is an algorithm in terms of STL?
what are you now programming Languages C+
How is stl different from c++ standard library?
STL 
