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.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

The Sieve of Eratosthenes is an algorithm that finds all prime numbers up to a given limit, n. It works by creating an array of Booleans, flag, of size n+1, initializing the array to true (assuming every number is a prime number in the beginning), and iteratively traversing the numbers from 2 to n, setting the values of indices that are multiples of other numbers to false. Write a program using the algorithm above, and display all the prime numbers up to 50.
You’re given an array of integers and another array of three distinct integers. The first array is guaranteed to only contain integers that are in the second array, and the second array represents a desired order for the integers in the first array. For example, a second array of [x, y, z] represents a desired order of [x, x,…,x, y, y,…,y, z, z,…,z] in the first array. Write a program that sorts the first array according to the desired order in the second array. The program should perform this in place (i.e.., it should mutate the input array), and it shouldn’t use any auxiliary space. Note that the desired order won’t necessarily be ascending or descending and that the first array won’t necessarily contain all three integers found in the second array-it might only contain one or two. Please Don't Use Chat GPT Answers Sample input array = [1,0,0,-1,-1,0,1,1] order = [0,1,-1] Sample output [0,0,0,1,1,1-1,-1] Requirements: 1. Implement the above problem statement using C Programming. 2.…
in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.
Write a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3
12. In the JAVA language write a program to input the elements of two integer arrays A1, A2 of size 10 and then print the absolute difference in the average of the arrays A1 and A2. The average of an array is the average of all the elements of the array.
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
3) Given an array A of type integer (Using C++):a) Ask the user to input the number of elements for the array correctly;b) Ask the user to input A’s elements and then, print them in reverse order as a single line of space-separated numbers;c) Print all elements of the array using recursion;d) Find maximum and minimum elements in the array using recursion. PS: Please answer part d) after getting a) to c) only.
Have an array with integers in it. This array contains all non-overlapping elements. Split it into two arrays using elements. As a result of this distinction, the elements of both series be the same total. Develop an algorithm that solves this problem using brute force. Time Explain the complexity and write the program in java language?
Write a program in any language you know to calculate the GCD for a sequence of numbers, let us say 4 numbers, kept in an array. You need to provide two solutions: 1) Iterative solution 2) Recursive solution. Test your code using the following numbers: 1048,1024,1480, 2640. The GCD of these numbers is 8.
A minimax or saddle point in a two-dimensional array is an element that is the minimum of its row and the maximum of its column, or vice verse. For example, in the following array11 22 33 33 99 55 66 77 77 44 99 22the element 33 is a minimax because it is the maximum of row 0 and the minimum of column 2. The element 55 is another minimax because it is the minimum of row 1 and the maximum of column 1.Write a program that reads a 4-by-3 matrix, and then prints the location and value of each minimax in the matrix. For example, it would printa[0][2] = 33 is a minimax a[1][1] = 55 is a minimaxfor the matrix shown above.
Java Code 2. Search and Rescue by CodeChum Admin Make a program that will accept an integer and loop for the same number of times as that of the inputted integer and input random integers and add it to the array/list one by one, per line. Afterwards, make your program accept another random integer. Using that final integer, compare from your array/list if the final integer's value is also present in your current array/list. If so, print "Present"; otherwise, print "None". Start coding now! Input The first line contains the size of the array/list. The next lines contain the integers. The last line contains an integer to be searched. 5 3 21 2 5 23 2 Output A line containing a string. Present
Answer the given question with a proper explanation and step-by-step solution. Write a Java program that creates a two-dimensional array of 10 rows of integers and 10 columns of integers. Each element has the integer stored inside that matches the row they are in. After, for each row, the sum of all the elements in each row is calculated using a for loop. The row with the largest sum is then displayed.