Array product in C++ using STL
In C++, we can quickly find array product using accumulate() and multiplies().
// C++ program to find array product #include <iostream> #include <numeric> using namespace std; // User defined function that returns product of // arr[] using accumulate() library function. int arrayProduct( int a[], int n) { return accumulate(a, a + n, 1, multiplies< int >()); } int main() { int a[] = { 5, 10, 15 }; int n = sizeof (a) / sizeof (a[0]); cout << arrayProduct(a, n); return 0; } |
chevron_right
filter_none
Output:
750
product of vector
// C++ program to find vector product #include <iostream> #include <numeric> #include <vector> using namespace std; // User defined function that returns product of // v using accumulate() library function. int arrayProduct(vector< int >& v) { return accumulate(v.begin(), v.end(), 1, multiplies< int >()); } int main() { vector< int > v{ 5, 10, 15 }; cout << arrayProduct(v); return 0; } |
chevron_right
filter_none
Output:
750
We can also use a custom function in accumulate. Refer numeric header in C++ STL | Set 1 (accumulate() and partial_product()) for details.
Rated as one of the most sought after skills in the industry, own the basics of coding with our C++ STL Course and master the very concepts by intense problem-solving.