Requirements: Your big-Oh bound must be as TIGHT as possible, e.g., if 0(n) is the correct answer, then 0(n^2) will NOT be given marks because it is not tight enough. Your big-Oh bound must be SIMPLIFIED, e.g., answers such as 0(n-1) or 0(3n) will NOT ben given marks because they are not simplified enough. Please write your answer for each question on the appropriate TODO line.

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
Give the worst-case big-oh time efficiency bound for each of the following
functions.
Requirements:
Your big-Oh bound must be as TIGHT as possible, e.g., if 0(n) is the correct
answer, then O(n^2) will NOT be given marks because it is not tight enough.
Your big-Oh bound must be SIMPLIFIED, e.g., answers such as 0(n-1) or 0(3n)
will NOT ben given marks because they are not simplified enough.
Please write your answer for each question on the appropriate TODO line.
II II I
(a)
II II||
def bigoh1(n: int) -> int:
res = 0
for i in range (n):
res = res + i
for i in range(n * n):
res = res - i
return res
Transcribed Image Text:Give the worst-case big-oh time efficiency bound for each of the following functions. Requirements: Your big-Oh bound must be as TIGHT as possible, e.g., if 0(n) is the correct answer, then O(n^2) will NOT be given marks because it is not tight enough. Your big-Oh bound must be SIMPLIFIED, e.g., answers such as 0(n-1) or 0(3n) will NOT ben given marks because they are not simplified enough. Please write your answer for each question on the appropriate TODO line. II II I (a) II II|| def bigoh1(n: int) -> int: res = 0 for i in range (n): res = res + i for i in range(n * n): res = res - i return res
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fundamentals of Datawarehouse
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