java random matches. Write a BinarySearch client that takes an int value T as a command-line argument and runs T trials of the following experiment for N = 103, 104, 105, and 106: generate two arrays of N randomly generated positive six-digit int values, and find the number of values that appear in both arrays. Print a table giving the average value of this quantity over the T trials for each value of N.

The experiment aims to study the number of overlaps between two randomly generated integer arrays for varying sizes. Specifically, for each array size N ∈ {10³,10⁴,10⁵,10⁶}, we generate two arrays of N random six-digit integers and count the number of integers that appear in both arrays. By repeating this experiment T times, we can derive an average number of overlaps for each array size N.

Algorithm:

1. Parse the command-line argument to get the value of T.
2. Initialize a list of array sizes [10³,10⁴,10⁵,10⁶].
3. For each size N in the list, execute the following steps:
   1. Initialize a variable totalMatches to zero.
   2. Repeat T times:
      1. Generate two random arrays of size N.
      2. Sort the first array.
      3. For each element in the second array, perform a binary search on the sorted first array to check for its existence.
      4. Increment the totalMatches by the number of elements found.
   3. Compute the average number of overlaps for N as Error converting from MathML to accessible text.totalMatches/T.
   4. Print the average number for N.

Step by stepSolved in 5 steps with 3 images