Chapter 7, Problem 18RE

Explanation of Solution

Two columns containing pos and found

• In this algorithm, there is a need to search for the specific position in an array so that it can be replaced or removed.
• All elements are visited until a match is found.
• Hence the loop is

  // Declare the variable

  int searchedValue = 100;

  int pos = 0;

  boolean found = false;

// Execute while loop

  while (pos < values.length && !found)

  {

    // Define if condition

  if (values[pos] == searchedValue)

  {

  found = true;

  }

  else

  {

  pos++;

  }

}

// Define if condition

  if (found)

  {

    // Print the statement

  System.out.println("Found at position: " + pos); }

  else

  {

    // Print the statement

  System...