def tri(n): if n == 1: return [1] prev= [0] + tri(n-1) for i in range(len(prev)-1): prev[i] return prev = prev[i] + prev[i+1] def quad (arr): n = len (arr) if n == 1: return arr[0] if n < 1: return -1 beg, mid, end = 0, n//2, n quad (arr[beg:mid]) qu = ad = quad(arr[mid:end]) return qu if qu › ad else a

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

find the BIG O complexity of the two function do this by writing the big O complexity of each line in the snippet

def tri(n):
if n == 1:
return [1]
prev = [0] + tri(n-1)
for i in range (len (prev)-1):
prev[i]
return prev
timmm
=
prev[i] + prev[i+1]
def quad (arr):
n = len(arr)
if n == 1:
return arr[0]
if n < 1:
return -1
beg, mid, end = 0, n//2, n
quad (arr[beg:mid])
qu =
ad = quad (arr[mid:end])
return qu if qu > ad else ad
Transcribed Image Text:def tri(n): if n == 1: return [1] prev = [0] + tri(n-1) for i in range (len (prev)-1): prev[i] return prev timmm = prev[i] + prev[i+1] def quad (arr): n = len(arr) if n == 1: return arr[0] if n < 1: return -1 beg, mid, end = 0, n//2, n quad (arr[beg:mid]) qu = ad = quad (arr[mid:end]) return qu if qu > ad else ad
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Arrays
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