6.9.4: Modify the algorithm to use an array of strings and find the last match.

Modify the algorithm in the "Common Array Algorithms" section to use an array of strings, and to find the last match. In this example, a match is a word of a specified length. For example, when asked for the last word of length 3, you should locate "was" at index 7.

import java.util.Scanner;

public class FindLast { public static void main (String [] args) { String[] words = { "Mary", "had", "a", "little", "lamb", "it's", "fleece", "was", "white", "as", "snow" }; Scanner in = new Scanner(System.in); System.out.print("Word length: "); int wordLength = in.nextInt(); boolean found = /* Your code goes here */; int pos = /* Your code goes here */; while (/* Your code goes here */) { if (/* Your code goes here */) { /* Your code goes here */; } else { /* Your code goes here */; } }

if (/* Your code goes here */) { System.out.println("Found " + words[pos] + " at position " + pos); } else { System.out.println("No word of length " + wordLength); } } }

6.9.5: Adapt this algorithm to print all positive values.

The program below uses the element separators algorithm in the "Common Array Algorithms" section to print all elements of an array, separated by vertical bars. Adapt this algorithm to print all positive values, separated by commas.

import java.util.Arrays; import java.util.Scanner;

public class ArrayUtils { public static void main (String [] args) { Scanner in = new Scanner(System.in); int length = in.nextInt(); int values[] = new int[length]; for (int i = 0; i < values.length; i++) { values[i] = in.nextInt(); } /* Update the algorithm below */

for (int i = 0; i < values.length; i++) { if (i > 0) { System.out.print(" | "); } System.out.print(values[i]); }

} }