Answered: def func1(num_1st): count = 0 for x in…

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

See similar textbooks

Related questions

Question

PLEASE ANSWER QUICKLY
For each of the following functions, use big-O notation to give a tight bound on the runtime in
terms of n, the number of elements in num_Ist. You can assume that the length of a list can be
computed in constant time (that is, the len() operation is O(1) - the amount of time required
to compute the length is the same no matter how big the list is).

def func1(num_1st):
count = 0
for x in range (len (num_1st)):
for y in range (len (num_1st)):
for z in range(3):
count += x*y*z
return count
O 0(1)
○ O(lg(n))
O O(n)
O O(n *lg(n))
O O(n²)
0 0(n³)
O 0(2")

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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