Exercise 9. Describe in plain English an algorithm that computes the number of common elements in 2 arrays of integers. You can assume that there are no duplicates in the first array, and also no duplicates in the second array. For example if array a₁ = [9, 3, 1, 5, 7, 11] and array a2 = [6, 2, 7, 8, 10, 5, 1], the algorithm should return 3 because the two arrays have three numbers in common, namely 1,5,7. Your algorithm should run in O(n log n) time.
Exercise 9. Describe in plain English an algorithm that computes the number of common elements in 2 arrays of integers. You can assume that there are no duplicates in the first array, and also no duplicates in the second array. For example if array a₁ = [9, 3, 1, 5, 7, 11] and array a2 = [6, 2, 7, 8, 10, 5, 1], the algorithm should return 3 because the two arrays have three numbers in common, namely 1,5,7. Your algorithm should run in O(n log n) time.
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
Related questions
Question
![Exercise 9. Describe in plain English an algorithm that computes the number of common elements in
2 arrays of integers. You can assume that there are no duplicates in the first array, and also no duplicates in
the second array. For example if array a₁ = [9, 3, 1, 5, 7, 11] and array a2 = [6, 2, 7, 8, 10, 5, 1], the algorithm
should return 3 because the two arrays have three numbers in common, namely 1,5,7. Your algorithm
should run in O(n log n) time.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F63a2ecd4-d40e-4f58-bfeb-302941b5ae7f%2F16224c5d-d683-4310-8741-f29db0ccc581%2F7iwozze_processed.png&w=3840&q=75)
Transcribed Image Text:Exercise 9. Describe in plain English an algorithm that computes the number of common elements in
2 arrays of integers. You can assume that there are no duplicates in the first array, and also no duplicates in
the second array. For example if array a₁ = [9, 3, 1, 5, 7, 11] and array a2 = [6, 2, 7, 8, 10, 5, 1], the algorithm
should return 3 because the two arrays have three numbers in common, namely 1,5,7. Your algorithm
should run in O(n log n) time.
Expert Solution

Step 1
The program is written in Java. Check the program screenshot for the correct indentation. Please check the source code and output in the following steps.
Step by step
Solved in 4 steps with 3 images

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

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education