Questions about Big O notation

for (i=0; i<n/2; ++i)
    for (j=0; j<n*2; j++)
        for (k=0; k<100; k++)
            m++;

How do you represent this code in Big Five notation?

big-o

2022-09-21 11:35

1 Answers

The code of the question is not properly highlighted, so it's hard to see.

If n is an input value in the algorithm,

The last for statement (for(k=0;k<100;k++)) is not dependent on n so

Exponential is going to be 2, not 3.

Simplified

O(n/2 * 2n * 100) == O(100n² ) == O(n² )

²²

That is, O (n²).

2022-09-21 11:35

Popular Tags

python x 4647

android x 1593

java x 1494

c x 927

c++ x 878

php x 692

html x 656