What is the time complexity of accumulate function in C++ STL for n integer vector?

Question

1.00/5 (1 vote)

See more:

I was solving a problem of arrray of finding the pivot index of the array, ie. left sum and right sum of that element should be equal I used accumulate in stl but i wonder if interviewer ask the time complexity of the accumulate fx then i shoul be answerable

What I have tried:

i google many website but could not locate the complexity of the accumulate function so my question is what is the time complexity of accumulate function in c++ STL for n integer vector?

Posted 11-Nov-20 22:08pm

Member 14849246

Updated 11-Nov-20 23:01pm

Add a Solution

2 solutions

Solution 1

Did your search find this page : accumulate - C++ Reference[^] ?

Posted 11-Nov-20 22:17pm

Rick York

Comments

CPallini 12-Nov-20 5:12am

5.

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Accepted Answer · 2020-11-11T23:01:00

Solution 2

It is O(N), of course.

Posted 11-Nov-20 23:01pm

CPallini