I am new to Data Structures and Algorithms.
for (int i=0; i<p; i++) {
// Statement
}
This loop have 3 steps. Initializing, comparing and incrementing. Will this be 3n?
Asked
Active
Viewed 916 times
0
OneCricketeer
- 179,855
- 19
- 132
- 245
bCM
- 97
- 1
- 3
- 12
-
1`for` loop is not a data structure, it is a statement, i.e. a control structure. – Sergey Kalinichenko Feb 12 '16 at 08:13
-
No, you don't initialize every time and you do an initial condition check before entering the loop to do `p` loops. – ChiefTwoPencils Feb 12 '16 at 08:15
-
1If you are talking about complexity, it will be linear (i.e. O(n)) since it will take p iterations. – Markus Feb 12 '16 at 08:15
1 Answers
0
Initialization is performed only once at the start of loop. Comparison and increment is performed in each iteration. In this case there will be p iterations so complexity will be constant ie p or in other words O(n)
Vikas
- 9
- 3
-
Saying O(n) really depends on what is happening inside the loop and what you consider n – OneCricketeer Feb 12 '16 at 08:54