what is an algorithm in terms of STL?
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 |
what's the difference between abstract class and concreate class? what's the meaning of standard template library(STL)?
What is stl stand for?
What is the disadvantage of templates ?
what is a template?
2 Answers Amazon, BITS, IBS, Wipro,
What are the different types of stl containers?
Give the output of the following program main() {int ret; ret=fork();ret=fork();ret=fork();ret=fork(); if(!ret) printf("sun"); else printf("solaris");
If P is the population on the first day of the year, B is the birth rate, and D is the death rate, the estimated population at the end of the year is given by the formula: The population growth rate is given by the formula: B – D Write a program that prompts the user to enter the starting population, birth and death rates, and n, the number of years. The program should then calculate and print the estimated population after n years. Your program must have at least the following functions: 1. growthRate: This function takes its parameters the birth and death rates, and it returns the population growth rate. 2. estimatedPopulation: This function takes its parameters the current population, population growth rate, and n, the number of years. It returns the estimated population after n years Your program should not accept a negative birth rate, negative death rate, or a population less than 2. please answer my question ....
What is C++ could you enplane me please?
why & sign is used in copy constructor
method overloading means what?
what is use of for loop?
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; }