Lab 05 - String Comparisons

Lab 5 – String Comparisons 1. Write a program called PrintStrings.java that prompts the user to enter two words, reads the user input, compares the words to each other, and displays them in lexicographic order (ABC order). Here is a sample run (blue is user input, black is program output): Please enter two words: silver red In lexicographic order: red silver 2. Copy the code below into a program called, StringEqual.java . Please note that if you are copying the code, you will need to retype the quotes (“). Compile and execute the code. How does the program compare the two strings? Modify the program so that it displays “ The Strings str2 and str3 are the same. ” if str2 and str3 really are equal (contain the same characters) when they are compared. (Hint: You will need to use the information discussed in Chapter 4 of the textbook on comparing Strings.) public class StringEqual{ public static void main(String[] args){ String str1 = “abcd”; String str2 = “abcdefg”; String str3 = str1 + “efg”; System.out.println(“str2 = “ + str2); System.out.println(“str3 = “ + str3); if (str2 == str3){ System.out.println(“The Strings str2 and str3 are the same.”); } else { System.out.println(“The Strings str2 & str3 are not the same.”); } } } 3. Now you are going to modify the program provided called MiddleString.java that prompts the user to enter three strings. You will adjust it to compare the String objects lexicographically, and print the middle---valued String. For example, if the three strings were "abcd", "wxyz", and "pqrs", the program would print "pqrs". Before you begin to code, do the following: ● make a list of all possible ordering possibilities for a given str1, str2, and str3 that would thoroughly test the code for the MiddleString.java program. You can use the provided test case plan to help you organize your tests ● Write an algorithm that will outline your code for MiddleString.java. Each algorithm step should be in close proximity to the relevant line(s) of code. ● Enter your test data as comments in the header section of the file. (Hint: Make sure that when you are listing out every possible ordering possibility through the program, you are consistent. This way you will easily find each possibility of ordering the three strings. This is important so that you can always find the middle value.)