What is the big-0 perfomance

computer science


What is the big-0 perfomance  estimate of the following function? 

int f (n) {

 int sum = 0;

 for (i = 0; i < n; i ++)

sum += 1;

return sum;

} // end f 

Related Questions in computer science category

The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.