(3) There is a function void fnE(int i, int num) that runs in 1000-i steps, regardless of what num is. Consider the following code snippet: void fnA(int S[]) { int n = s.length; for (int i=0;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
icon
Related questions
Question
(3) There is a function void fnE(int i, int num) that runs in 1000-i steps, regardless of what
num is. Consider the following code snippet:
void fnA(int S[]) {
S.length;
for (int i=0;i<n;i++) {
fnE(i, S[i]);
int n =
}
}
What's the running time in Big-O of fnA as a function of n, which is the length of the array S. You
should assume that it takes constant time to determine the length of an array.
(4) Show that h(n) = 16n2 + 1ln* +0.1n³ is not O(n“).
Transcribed Image Text:(3) There is a function void fnE(int i, int num) that runs in 1000-i steps, regardless of what num is. Consider the following code snippet: void fnA(int S[]) { S.length; for (int i=0;i<n;i++) { fnE(i, S[i]); int n = } } What's the running time in Big-O of fnA as a function of n, which is the length of the array S. You should assume that it takes constant time to determine the length of an array. (4) Show that h(n) = 16n2 + 1ln* +0.1n³ is not O(n“).
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Algebraic Expressions
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
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education