H H import random 3 def solution (a, b): intersection = [] length_a = len(a) length_b = len (b) i = 0 j = 0 while i < length_a and j < length_b: if a[i] < b[j]: i += 1 - H - elif b[j] < a[i]: j += 1 else: def main(): j += 1 i += 1 print(intersection) intersection.append(b[j]) array_seven = [] array_eight = [] for i in range (1000): main() num_one = random.randint(0, 3000) num_two = random.randint(0, 3000) if num_one not in array_seven: array_seven.append(num_one) if num_two not in array_eight: array_eight.append(num_two) array_seven.sort() array_eight.sort() solution (array_seven, array_eight)
H H import random 3 def solution (a, b): intersection = [] length_a = len(a) length_b = len (b) i = 0 j = 0 while i < length_a and j < length_b: if a[i] < b[j]: i += 1 - H - elif b[j] < a[i]: j += 1 else: def main(): j += 1 i += 1 print(intersection) intersection.append(b[j]) array_seven = [] array_eight = [] for i in range (1000): main() num_one = random.randint(0, 3000) num_two = random.randint(0, 3000) if num_one not in array_seven: array_seven.append(num_one) if num_two not in array_eight: array_eight.append(num_two) array_seven.sort() array_eight.sort() solution (array_seven, array_eight)
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
1st Edition
ISBN:9780357392676
Author:FREUND, Steven
Publisher:FREUND, Steven
Chapter6: Creating, Sorting, And Querying A Table
Section: Chapter Questions
Problem 10EYK
Related questions
Question
Hi, will you please tell me the big o notation for this python code?
![H
F
import random
def solution (a, b):
intersection = []
length_a= len(a)
length_b = Len (b)
i = 0
j = 0
while i < length_a and j < length_b:
if a[i] <b[j]:
i += 1
elif b[j] < a[i]:
j += 1
else:
j += 1
i += 1
print(intersection)
def main():
intersection.append(b[j])
array_seven = []
array_eight = []
for i in range (1000):
main()
num_one = random.randint(0, 3000)
num_two = random.randint(0, 3000)
if num_one not in array_seven:
array_seven.append(num_one)
if num_two not in array_eight:
array_eight.append(num_two)
array_seven.sort()
array_eight.sort()
solution (array_seven, array_eight)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F442cdeaf-d6f5-4c90-9eca-defd0049fe9f%2F0d9abc79-ad26-44d2-874d-e1b16e09e2cf%2Fc3lk5y7_processed.png&w=3840&q=75)
Transcribed Image Text:H
F
import random
def solution (a, b):
intersection = []
length_a= len(a)
length_b = Len (b)
i = 0
j = 0
while i < length_a and j < length_b:
if a[i] <b[j]:
i += 1
elif b[j] < a[i]:
j += 1
else:
j += 1
i += 1
print(intersection)
def main():
intersection.append(b[j])
array_seven = []
array_eight = []
for i in range (1000):
main()
num_one = random.randint(0, 3000)
num_two = random.randint(0, 3000)
if num_one not in array_seven:
array_seven.append(num_one)
if num_two not in array_eight:
array_eight.append(num_two)
array_seven.sort()
array_eight.sort()
solution (array_seven, array_eight)
Expert Solution

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

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.Recommended textbooks for you
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage

New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage

New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning

Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning

C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning

EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT