Method return problem

Question

Hi, please help me to see the problem I facing for my assignment.
I need to do a few of non-duplicate random number and store them into an array. Then assign a KEY and search the array to get the index number of the array. I'm doing a linear search in a different method(not main).
Here is the algorithm for the linear search and I need to do exactly like it.
ALGORITHM SearchSorted(A[0..n − 1], K)
// Searches for a given value K in a given array A of n numbers which
// is sorted into nondecreasing order. The index of the first item in A that
// matches K is returned, or −1 if there are no such items.
i �� 0
while i < n do
if K < A[i]
return &#8722;1
else
if K = A[i]
return i
else
i �� i + 1
return &#8722;1
And here is my coding.
public static int Linear(int A[], int K) // method called, array and key
     int i = 0;
          while(i<A.length)
          if(K<A) // will stop when array's element is greater than the key and return -1
               return -1;
          else
               if(K==A[i]) // will return index number of the array is key found
                    return i;
               else
                    i = i + 1;
          return -1; // will return -1 if no match of element
     return -1; // method ask for return value, any way to get rid of this?
The problem I facing is, each time I run it, it will only return one -1 instead of many -1 until the Key is been found.
If I delete the last "return -1", the program can't run. If I change the last second "return -1" to "System.out.println("-1", the program can run smoothly but it will extra one more -1 at the output and i think it cause by the last return.
What should I do to make it better? Thank you very much for helping.

Answer 1

I think you should delete this line:
return -1; // will return -1 if no match of elementWith this line the cycle will run only once.