Question
Problem 3 Write down the running time equation, T(n), of the program prob3 below. Find an upper bound of T(n), using the Big-O notation to
Problem 3
Write down the running time equation, T(n), of the program prob3 below.
Find an upper bound of T(n), using the Big-O notation to describe the upper bound.
Find a lower bound of T(n), using the Omega notation to describe the upper bound.
# # Input: a list L that has n numbers. # def prob3(L): s = 0 for x in L: for i in range(len(L)): s = x * L[i] for x in L: s += x return s
ANSWER:
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Fundamentals Of Database Management Systems
Authors: Mark L. Gillenson
2nd Edition
0470624701, 978-0470624708
