Skip to content
Related Articles

Related Articles

Improve Article

Array sum in C++ STL

  • Difficulty Level : Basic
  • Last Updated : 28 Oct, 2017

In C++, we can quickly find array sum using accumulate()




// C++ program to demonstrate working of accumulate()
#include <iostream> 
#include <numeric>     
using namespace std;
   
// User defined function that returns sum of
// arr[] using accumulate() library function.
int arraySum(int a[], int n) 
{
    int initial_sum  = 0; 
    return accumulate(a, a+n, initial_sum);
}
   
int main() 
{
    int a[] = {5 , 10 , 15} ;
    int n = sizeof(a)/sizeof(a[0]);
    cout << arraySum(a, n);
    return 0;
}

Output:

30

Sum of vector




// C++ program to demonstrate working of accumulate()
#include <iostream> 
#include <vector> 
#include <numeric>     
using namespace std;
   
// User defined function that returns sum of
// arr[] using accumulate() library function.
int arraySum(vector<int> &v) 
{
    int initial_sum  = 0; 
    return accumulate(v.begin(), v.end(), initial_sum);
}
   
int main() 
{
    vector<int> v{5 , 10 , 15} ;
    cout << arraySum(v);
    return 0;
}

Output:

30

We can also use a custom function in accumulate. Refer numeric header in C++ STL | Set 1 (accumulate() and partial_sum()) for details.

This article is contributed by kartik. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for foundation plus STL.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.



My Personal Notes arrow_drop_up
Recommended Articles
Page :