Create a BinarySearch client that accepts an integer T as a command-line option and performs T trials of the following experiment for N = 103, 104, 105, and 106: Find the number of values that appear in both arrays of N randomly generated positive six-digit int values. For each number of N, print a table with the average value of this quantity over the T trials.

IN Java Overloaded Sorting. In class, we have primarily used integer arrays asexamples when demonstrating how to sort values. However, we can sort arrays madeof other primitive datatypes as well.In this assignment, you will create three arrays of size 8; one array will be an integerarray, one will be a char array, and one will be a float array. You will then ask the userto state what kind of data they want to sort – integers, chars, or floats.The user will then input 8 values. You will store them in the appropriate array based onwhat datatype they initially stated they would use.You will create a function called sortArray() that takes in an integer array as aparameter, and two overloaded versions of the same function that take in a char arrayand float array as parameters respectively. You will use these functions to sort theappropriate array and display the sorted values to the user.Note: You must make overloaded functions for this assignment – they must all be calledsortArray(). You…

Write a complete program that sorts dword unsigned integer array in descending order. Assume that the user doesn’t enter more than 40 integers. You MUST use the template-1-2.asm Download template-1-2.asm        and follow all the directions there. Note: you have to review 3 peer assignments.   You can’t add any more procedures to the template. The procedures can’t use any global variables (variables that are inside .data segment). The caller of any procedures sends its argument through the stack. Inside any procedures, if you need to use a register, you have to preserve its original value. You can't use uses, pushad operators. The callee is in charge of cleaning the stack Sample run: Enter up to 40 unsigned dword integers. To end the array, enter 0. After each element press enter:  1 4 3 8 99 76 34 5 2 17 0 Initial array: 1 4 3 8 99 76 34 5 2 17 Array sorted in descending order: 99 76 34 17 8 5 4 3 2 1 template-1-2.asm include irvine32.inc ;…

In java   Browse Project Gutenberg (https://www.gutenberg.org/) for plain text versions of one or more works of literature of your choosing. Write a program that repeatedly searches a file for a target word or phrase.• Allow the user to supply the name of the file to search by means of a command-line argument; if the user does not supply a command line argument, ask for a file name interactively.• You may use either an array or an ArrayList to store each line in the file; but if you use an array, you’ll have to determine the array size (number of lines) before allocating the array. There are several ways to do this.• Report how many lines were read from the file.• Search for either individual words or phrases (Hint: use the .contains method, it’ll work for either a word or a phrase)• Show both the line number and the line itself for each line that contains the search target entered by the user (you may count the first line in the file as line 0).• If a search word is part of a larger…

Here is the iterative implementation of binary search: For each call to binary_search below, indicate how many times the code inside the while loop will execute.  animals = ["aardvark", "cat", "dog", "elephant", "panda"] 1. binary_search("elephant", animals)                                                                                           2. binary_search("dog", animals)                                                                                           3. binary_search("anteater", animals)

Q3. Create a method that accepts a double array as a parameter and returns true if the values in the array are sorted in increasing order. Using this header: public static boolean isSorted (double [] list) In the main method, write test code that gets the user to enter a series of numbers using the getNumsFromUser() method in Q1, then use the isSorted( ) method to determine if the user's numbers are sorted. Sample run How many numbers in the list? 5 Enter the list: 4 5 79 10 The list is already sorted How many numbers in the list? 5 Enter the list: 2 4 6 4 9 The list is not sorted

please solve within30 minutes..