Using Java

Objective: Implement both linear search and binary search, and see which one performs better given an array 1,000 randomly generated whole numbers (between 0-999), a number picked to search that array at random, and conducting these tests 20 times. Each time the search is conducted the number of checks (IE number of times the loop is ran or the number of times the recursive method is called) needs to be counted and at the end the total number of checks should be averaged A few notes e Each algorithm (linear search and binary search) is ran 20 times Each time a new sorted array of whole numbers is created and populated with random values from 0-999 A value to be searched in the said array is randomly selected from the range 0-999 o Each algorithm must display if that number was successfully found o Each algorithm must display the number of checks it took to determine the above e It is advisable to create a method that retuns the sorted array o Populate the array with random numbers o Search the array next o Return whether or not the value was found in the array . Implement both searches as a method o However instead of returning whether or not it found the number it should return the number of checks. o Whether the value is or is not found can be printed in the method Binary search is fairly simple to create using recursion o Do not count the out of bounds or stopping index as a check Example: Welcome to the search tester. We are going to see which algorithm performs the best out of 20 tests Searching using linear search Found! Searching using binary search Found! Linear Checks: 753 Binary Checks: 8 Searching using linear search Found! Searching using binary search Found! Linear Checks: 834 Binary Checks: 10 Searching using linear search Not Found Searching using binary search Not Found Linear Checks: 1000 Binary Checks: 10 Searching using linear search Found