Question 1.2 What is the time complexity of the following three algorithms? Express your answer in terms of Big- O notation and justify your answer: LA) def display_names_with ID(names): ID - 0: for n in names: print ("ID for ", n, "is", ID) ID - ID + 1
Question 1.2 What is the time complexity of the following three algorithms? Express your answer in terms of Big- O notation and justify your answer: LA) def display_names_with ID(names): ID - 0: for n in names: print ("ID for ", n, "is", ID) ID - ID + 1
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
Question 1.2. Both are continous. Please answer separately as (a,b,c). Please explain also.

Transcribed Image Text:Question 1.2
What is the time complexity of the following three algorithms? Express your answer in terms of Big-
O notation and justify your answer:
A)
def display_names_with_ID(names):
ID = 0;
for n in names:
print ("ID for ", n, "is", ID)
ID = ID + 1
![B)
def find_item (mylist, item) :
if len (mylist)
return False
== 0:
else:
n = len (mylist)//2
print ("Midpoint =", mylist[n] )
if mylist [n] == item:
return True
else:
if item<mylist [n]:
return find item (mylist[:n], item)
else:
return find_item (mylist [n+1:], item)
C)
print ("Times tables grid")
n = 10
for i in range (1, n+1) :
print (i, end="\t")
for i in range (0, 75):
print ("=", end='')
print ()
for i in range (1, n+1):
for j in range (1, n+1):
print (i * j, end="\t")](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd0ba783c-c80e-42b7-85a9-81d77903bc5b%2F70cab3e6-f6c5-4440-898e-4b4e857089a1%2F3tkzyhp_processed.jpeg&w=3840&q=75)
Transcribed Image Text:B)
def find_item (mylist, item) :
if len (mylist)
return False
== 0:
else:
n = len (mylist)//2
print ("Midpoint =", mylist[n] )
if mylist [n] == item:
return True
else:
if item<mylist [n]:
return find item (mylist[:n], item)
else:
return find_item (mylist [n+1:], item)
C)
print ("Times tables grid")
n = 10
for i in range (1, n+1) :
print (i, end="\t")
for i in range (0, 75):
print ("=", end='')
print ()
for i in range (1, n+1):
for j in range (1, n+1):
print (i * j, end="\t")
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY