// a) int sum = 0; for (int i = 1; i <= N + 2; i++) { sum++; } for (int j = 1; j <= N ⋆ 2; j++) { sum += 5; } cout << sum << endl; // b) int sum = 0; for (int i = 1; i <= N 5; i++) { for (int j = 1; j <= N 5; j+= 2) { sum++; } } cout << sum << endl; answer: answer:
// a) int sum = 0; for (int i = 1; i <= N + 2; i++) { sum++; } for (int j = 1; j <= N ⋆ 2; j++) { sum += 5; } cout << sum << endl; // b) int sum = 0; for (int i = 1; i <= N 5; i++) { for (int j = 1; j <= N 5; j+= 2) { sum++; } } cout << sum << endl; answer: answer:
Chapter2: Using Data
Section: Chapter Questions
Problem 14RQ
Related questions
Question
Give a tight bound of the nearest runtime complexity class for each of the following code fragments in Big-Oh notation, in terms of the variable N. In other words, write the code's growth rate as N grows. Write a simple expression that gives only a power of N using a caret ^character for exponentiation, such as O(N^2) to represent O(N2) or O(log N) to represent O(log2 N). Do not write an exact calculation of the runtime such as O(2N3 + 4N + 14).
![// a)
int sum = Ø;
for (int i = 1; i <= N + 2; i++) {
sum++;
}
for (int j =
sum += 5;
1; j <= N * 2; j++) {
}
cout << sum << endl;
// b)
int sum = 0;
for (int i = 1; i <= N - 5; i++) {
for (int j
sum++;
}
= 1; j <= N - 5; j += 2) {
}
cout << sum << endl;
answer:
answer:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ffa25f1dd-a44a-4ace-ac61-e3b8d69dd121%2F575b4f89-b470-47aa-99a0-1ff7f75aeab7%2F44a4l8_processed.png&w=3840&q=75)
Transcribed Image Text:// a)
int sum = Ø;
for (int i = 1; i <= N + 2; i++) {
sum++;
}
for (int j =
sum += 5;
1; j <= N * 2; j++) {
}
cout << sum << endl;
// b)
int sum = 0;
for (int i = 1; i <= N - 5; i++) {
for (int j
sum++;
}
= 1; j <= N - 5; j += 2) {
}
cout << sum << endl;
answer:
answer:
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
Step 1
In this question, it is asked to calculate the Big-Oh notation for the following code segments.
The exponential complexity must be defined with ^.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
Recommended textbooks for you
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning