Create an unsorted array of 50,000 random integers that are in the range from 1 to 10,000. Sort this array using the method Arrays sort. Create a second array of 1000 integers randomly selected from the sorted array. Search the sorted array for each integer in the second array, using an iterative linear search, a recursive linear search, an iterative binary search, and a recursive binary search. Using the technique described, calculate the total execution time of the 1000 searches for each searching method. What, if anything, are you able to conclude?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here