Introduction - If you have any usage issues, please Google them yourself
Write a sequential search method public static int [] ordinalSearch (int data [], int key) This method returns an array (if the key exists, the value of each element in the array subscript in the original array data for the keyword key if the key does not exist, it returns a length for an array of elements to-1).