/**
 * @author David Manouchehri
 *         Created on 6/26/15 at 2:34 PM.
 *         All content is under the MIT License unless otherwise specified.
 *         See LICENSE.txt for details.
 */

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

public class WorkingWithStrings {
    public static void main(String[] args) {

        Scanner userInput = new Scanner(System.in);
        System.out.print("TEST");
        printInOrder(userInput.next(), userInput.next());

//        int test = numWords(userInput.nextLine());
//        System.out.println(test);
//        reverse(userInput.next());
//        String holder = repeat(userInput.next(), userInput.nextInt());
//        System.out.println(holder);
    }
    public static void reverse(String input) {
        System.out.println("Original word: " + input);

        String reversed = "";
        for(int i = input.length() - 1; i >= 0; i--)
            reversed += input.charAt(i);

        // Much easier way of doing it, but probably defeats the purpose of the assignment.
        // String reversed = new StringBuilder(input).reverse().toString();

        System.out.println("Original word: " + reversed);
    }
    public static String repeat(String str, int n) {
        String result = "";
        for(int i = 0; i < n; i++)
            result += str;
        return result;
    }
    public static int numWords(String input) {
        if (input.isEmpty())
            return 0;

        /* Doesn't handle multiple blank spaces, but the assignment didn't say if we need to deal with that or not. */
        String breakers[]=input.split(" ");
        return breakers.length;
    }
    public static void printInOrder(String str1, String str2) {
        String[] strs = {str1, str2};
        Arrays.sort(strs);
        for(int i = 0; i < strs.length; i++)
            System.out.println(strs[i]);
    }
}

@@ -415,17 +415,18 @@
         
-p
+//
 rintInOr
@@ -467,26 +467,24 @@
 xt());%0A%0A
-//
         
 int test
@@ -479,19 +479,22 @@
     
+Str
 in
-t
+g
  test = 
 numW
@@ -489,24 +489,23 @@
  test = 
-numWords
+replace
 (userInp
@@ -515,19 +515,13 @@
 next
-Line
 ());%0A
-//
     
@@ -1718,20 +1718,25 @@
 tring%5B%5D 
+inputLi
 st
-rs
  = %7Bstr1
@@ -1764,20 +1764,25 @@
 ys.sort(
+inputLi
 st
-rs
 );%0A     
@@ -1803,20 +1803,25 @@
  0; i %3C 
+inputLi
 st
-rs
 .length;
@@ -1861,16 +1861,429 @@
 tln(
-strs%5Bi%5D)
+inputList%5Bi%5D);%0A    %7D%0A    public static String replace(String input) %7B%0A        String holder = %22%22;%0A        for(int i = 0; i %3C input.length(); i++)%0A            if(input.charAt(i) == 'a' %7C%7C input.charAt(i) == 'e' %7C%7C input.charAt(i) == 'i'%0A                    %7C%7C input.charAt(i) == 'o' %7C%7C input.charAt(i) == 'u')%0A                holder += 'z';%0A            else%0A                holder += input.charAt(i);%0A        return holder
 ;%0A  

replace passes tests.