Write a generic method that implements a linear search in an array.  This method should compare the search key with each element in an array until the search key is found or until the end of the array is reached.  If the search key is found, return its location in the array; otherwise, return -1.  Write a test application that inputs and searches an int array and a double array.  The test application should have a GUI like this:

When the user clicks the “Create integers” button, the program generates 6 random integers between 0 and 999.  The user then enters a search key and presses the “Search” button.  The program will display the search result:

If the search key is not in the array, display “Value not found”:

if the “Create doubles” button is pressed, generate 6 random double values that have two digits after the decimal point between 0.00 and 99.99.  You can do this by generating 6 random integers between 0 and 999 and divide them by 100.  Do the same search as the integers.

 

Transcribed Image Text:

Linear Search Create integers Create doubles Enter Search Key: Search Linear Search Create integers Create doubles Enter Search Key: Search

Answer rating: 100% (QA)

import javautil class Solution public static void SearchE arrayE value generic met... View the full answer