This question already has an answer here:
- What is O(…) and how do I calculate it? 2 answers
How do I find the O - notation complexity for the following?
int sum = 0; for (int i = 1; i <= n*2; i++ ) sum++;
I read the guide on Big - O and other posts on Big -O complexity, but I'm still lost.