Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False

. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False

Database System Concepts
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
icon
Related questions
Question

Please provide step by step solution with an explanation.

 

4. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False
Transcribed Image Text:4. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Function Arguments
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.
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
SEE MORE TEXTBOOKS