For the following programming problems, you need to time a section of code in C++. For example, the following statements time the execution of the function doSomething: #include clock_t start = clock(); doSomething(); clock_t finish = clock(); double overallTime = static_cast(finish - start)/ CLOCKS_PER_SEC; unsigned long long int sum; Consider the following two loops: //Loop A for(i = 1; i <= n; i++) for(j = 1; j <= 10000; j++) sum = sum + j; //Loop B for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= j; k++ ) sum = sum + k; What is the Big O of this loop? Design and implement an experiment to find a value of n for which Loop B is faster than Loop A.
For the following programming problems, you need to time a section of code in C++. For example, the following statements time the execution of the function doSomething: #include clock_t start = clock(); doSomething(); clock_t finish = clock(); double overallTime = static_cast(finish - start)/ CLOCKS_PER_SEC; unsigned long long int sum; Consider the following two loops: //Loop A for(i = 1; i <= n; i++) for(j = 1; j <= 10000; j++) sum = sum + j; //Loop B for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= j; k++ ) sum = sum + k; What is the Big O of this loop? Design and implement an experiment to find a value of n for which Loop B is faster than Loop A.
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
Related questions
Question
For the following programming problems, you need to time a section of code in C++. For example, the following statements time the execution of the function doSomething:
#include <ctime>
clock_t start = clock();
doSomething();
clock_t finish = clock();
double overallTime = static_cast<double>(finish - start)/ CLOCKS_PER_SEC;
unsigned long long int sum;
- Consider the following two loops:
//Loop A
for(i = 1; i <= n; i++)
for(j = 1; j <= 10000; j++)
sum = sum + j;
//Loop B
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
for(k = 1; k <= j; k++ )
sum = sum + k;
What is the Big O of this loop? Design and implement an experiment to find a value of n for which Loop B is faster than Loop A.
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 1 images
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education