Intro to JAVA please see below thank you! ______________________________________
ID: 3913823 • Letter: I
Question
Intro to JAVA please see below thank you!
__________________________________________________________________________
Suppose you want to find the position of the second match. You could remove the first match and start over, but that would be wasteful. Instead, adapt the algorithm from that section so that it starts the search at a given position, not zero. Complete the following code.
CODE:
public class FindNext
{
/**
Finds the next occurrence of an element in an array.
@param values an array of values
@param searchedValue the value to search for
@param start the position at which to start the search
@return the position of the first match at position >= start,
or -1 if the element was not found
*/
int findNext(int[] values, int searchedValue, int start)
{
. . .
}
}
Explanation / Answer
If you have any doubts, please give me comment...
public class FindNext
{
/**
Finds the next occurrence of an element in an array.
@param values an array of values
@param searchedValue the value to search for
@param start the position at which to start the search
@return the position of the first match at position >= start,
or -1 if the element was not found
*/
int findNext(int[] values, int searchedValue, int start)
{
for(int position = start; position<values.length; position++){
if(values[position]==searchedValue)
return position;
}
return -1;
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.