Answered: // a) int sum = 0; for (int i = 1; i <=…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

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(N²) or O(log N) to represent O(log₂ N). Do not write an exact calculation of the runtime such as O(2N³ + 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:

Expert Solution

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

SEE SOLUTION Check out a sample Q&A here

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