Java

describe the order of growth using big O notation

1. int count = 0;

for (int i = 1; i <= N ; i ++)

cout ++;

for (int j = 1; j <= N ; j ++)

count ++;

2. int count = 0;

for (int i = 1; i <= N /2; i ++)

for (int i = 1; i <= N /2; i ++)

count ++;