The method int getPosition(int array[], int X) is designed to return the position of X within the array. If X is not in the array, the method may return either -1 or array.length. Which of the following is a correct implementation for this method?

Question

A) int k = 0;
while (array[k] != X)
{
k++;
}
return k;
B) int k = 0;
while (k < array.length)
{
if (array[k] != X)
return -1;
else
return k;
}
C) int k = 0;
while (k < array.length && array[k] != X)
{
k++;
}
return k;
D) int k = 0;
while (k < array.length && array[k] != X)
{
k++;
return k;
}

Answer 1

C) int k = 0;
while (k < array.length && array[k] != X)
{
k++;
}
return k;