What's the Big-Oh runtime of this C++ code?

Nov 28th, 2014
Anonymous
Category:
Programming
Price: $5 USD

Question description

Give a tight bound of the nearest runtime complexity class for 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, such as O(N2) or O(log N), not an exact calculation like O(2N^3+ 4N + 14). 

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;



Tutor Answer

(Top Tutor) kukistars
School: Purdue University

Studypool has helped 1,244,100 students

Review from student
Anonymous
" Outstanding Job!!!! "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1823 tutors are online

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors