2, What is the computational complexity of the following function? // findprimes // This function will find (and print to the screen) all // prime numbers up to the input parameter n; // inputs: integer n // This is C++ code, but it should read much like Java void findprimes (int n) int i; int j; // setting a(0] and a(1) to "not prime" int a[n] ; a [0) -0; a[1) =0; ; for (i - 2; i< n; i++) // initialize everything to "prime"; will check later a[i] - 1; for (i = 2; i < n; i++) if (a(i]) for (j = i; (j*i) < n; j++) { ali*j] = 0; } for (i = 2; i < n; i++) { // cout <« i c< "," << a[i) <« endl; くく if (a(i]) cout << " " <« i ; cout << endl;
2, What is the computational complexity of the following function? // findprimes // This function will find (and print to the screen) all // prime numbers up to the input parameter n; // inputs: integer n // This is C++ code, but it should read much like Java void findprimes (int n) int i; int j; // setting a(0] and a(1) to "not prime" int a[n] ; a [0) -0; a[1) =0; ; for (i - 2; i< n; i++) // initialize everything to "prime"; will check later a[i] - 1; for (i = 2; i < n; i++) if (a(i]) for (j = i; (j*i) < n; j++) { ali*j] = 0; } for (i = 2; i < n; i++) { // cout <« i c< "," << a[i) <« endl; くく if (a(i]) cout << " " <« i ; cout << endl;
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
What is the computational complexity of the following function? /
See the question!
!["big-Oh" notation for each. Which one
2, What is the computational complexity of the following function?
// findprimes
// This function will find (and print to the screen) all
// prime numbers up to the input parameter n;
// inputs: integer n
// This is C++ code, but it should read much like Java
void findprimes (int n)
{
int i; int j;
// setting a(0] and a[1) to "not prime"
int a[n] ;
a [0] =0;
a(1) =0; ;
for (i = 2; i< n; i++)
// initialize everything to "prime"; will check later
a[i) - 1;
for (i - 2; i < n; i++)
if (a(i])
for (j = i; (j*i) < n; j++)
%3!
a[i*j]
= 0;
e of 20
for (i = 2; i < n; i++)
{
//
cout << i << "," << a[i) << endl;
if (ali))
cout << " " <« i ;
cout << endl;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb9aa283c-b94e-432f-a098-2a0081e20cc1%2F1741e17c-6ede-47e4-8787-3f72c520a49c%2Fv3jtn8c_processed.jpeg&w=3840&q=75)
Transcribed Image Text:"big-Oh" notation for each. Which one
2, What is the computational complexity of the following function?
// findprimes
// This function will find (and print to the screen) all
// prime numbers up to the input parameter n;
// inputs: integer n
// This is C++ code, but it should read much like Java
void findprimes (int n)
{
int i; int j;
// setting a(0] and a[1) to "not prime"
int a[n] ;
a [0] =0;
a(1) =0; ;
for (i = 2; i< n; i++)
// initialize everything to "prime"; will check later
a[i) - 1;
for (i - 2; i < n; i++)
if (a(i])
for (j = i; (j*i) < n; j++)
%3!
a[i*j]
= 0;
e of 20
for (i = 2; i < n; i++)
{
//
cout << i << "," << a[i) << endl;
if (ali))
cout << " " <« i ;
cout << endl;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY