Completed quiz

LoopFun.java

@@ -1,40 +1,84 @@
 public class LoopFun
 {
 
-      /**
-       * Given a number, return the factorial of that number.
-       * For example, given 5, the factorial is 5 x 4 x 3 x 2 x 1 which should return 120.
-       * @param number
-       * @return the factorial of the number
-       */
-      public int factorial(int number){
-          return -1;
-      }
-
-      /**
-       * Given a phrase, get the acronym of that phrase. Acronym is the combination of
-       * the first character of each word in upper case.
-       * For example, given "Ruby on Rails", this method will return "ROR"
-       * @param phrase
-       * @return Upper case string of the first letter of each word
-       */
-      public String acronym(String phrase) {
-          return null;
-      }
-
-      /**
-       * To prevent anyone from reading our messages, we can encrypt it so it will only be readable by its
-       * intended audience. This method encrypt the message by shifting the letter by 3 characters. If the character is
-       * at the end of the alphabet, it will wraps around.
-       * For example:
-       *  'a' => 'd'
-       *  'w' => 'z'
-       *  'x' => 'a'
-       *  'y' => 'b'
-       * @param word
-       * @return the encrypted string by shifting each character by three character
-       */
-      public String encrypt(String word) {
-          return null;
-      }
+    /**
+     * Given a number, return the factorial of that number.
+     * For example, given 5, the factorial is 5 x 4 x 3 x 2 x 1 which should return 120.
+     * @param number
+     * @return the factorial of the number
+     */
+    public int factorial(int number){
+        int factorial = 1;
+
+        for (int i = 2; i <= number; i++) {
+            factorial *= i;
+        }
+
+        return factorial;
+    }
+
+    /**
+     * Given a phrase, get the acronym of that phrase. Acronym is the combination of
+     * the first character of each word in upper case.
+     * For example, given "Ruby on Rails", this method will return "ROR"
+     * @param phrase
+     * @return Upper case string of the first letter of each word
+     */
+    public String acronym(String phrase) {
+        StringBuilder sbAcronym = new StringBuilder();
+
+        String firstCapital = phrase.substring(0, 1).toUpperCase();
+        sbAcronym.append(firstCapital);
+
+        for (int i = 1; i < phrase.length(); i++) {
+            if (phrase.charAt(i) == ' ') {
+                sbAcronym.append(phrase.charAt(i + 1));
+            }
+        }
+
+        String Acronym = sbAcronym.toString().toUpperCase();
+
+        return Acronym;
+    }
+
+    /**
+     * To prevent anyone from reading our messages, we can encrypt it so it will only be readable by its
+     * intended audience. This method encrypt the message by shifting the letter by 3 characters. If the character is
+     * at the end of the alphabet, it will wraps around.
+     * For example:
+     *  'a' => 'd'
+     *  'w' => 'z'
+     *  'x' => 'a'
+     *  'y' => 'b'
+     * @param word
+     * @return the encrypted string by shifting each character by three character
+     */
+    public String encrypt(String word) {
+        // char[] toEncode = word.toCharArray();
+
+        StringBuilder sbEncryption = new StringBuilder(); 
+
+        char arr[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
+
+        int k;
+
+        for (int i = 0; i < 26; i++) {
+            for (int j = 0; j < word.length(); j++) {
+                if (word.charAt(j) == arr[i]){
+                    k = i;
+
+                    if (k < 23) {
+                        sbEncryption.append(arr[(k + 3)]);
+                    }
+                    
+                    if (k >= 23) {
+                        sbEncryption.append(arr[(k - 23)]);
+                    } 
+                }
+            }
+        }
+        String encryption = sbEncryption.toString();
+
+        return encryption;
+    }
 }

MathUtilities.java

@@ -1,50 +1,54 @@
 public class MathUtilities{
-  /**
-   * Add two number together
-   * @param num1 first number
-   * @param num2 second number
-   * @return the sum of the two numbers
-   */
-  public int add(int num1, int num2){
-      return -1;
-  }
+    /**
+     * Add two number together
+     * @param num1 first number
+     * @param num2 second number
+     * @return the sum of the two numbers
+     */
+    public int add(int num1, int num2){     
+        return (num1 + num2);
+    }
 
-  /**
-   * Add two number together
-   * @param num1 first number
-   * @param num2 second number
-   * @return the sum of the two numbers
-   */
-  public double add(double num1, double num2){
-      return -1;
-  }
+    /**
+     * Add two number together
+     * @param num1 first number
+     * @param num2 second number
+     * @return the sum of the two numbers
+     */
+    public double add(double num1, double num2){
+        return (num1 + num2);
+    }
 
-  /**
-   * Get half the value of the number
-   * @param number the number given
-   * @return the half of the number in double
-   */
-  public double half(int number) {
-      return -1;
-  }
+    /**
+     * Get half the value of the number
+     * @param number the number given
+     * @return the half of the number in double
+     */
+    public double half(int number) {
+        double doubNum = (double) number;
+        return (doubNum / 2);
+    }
 
-  /**
-   * Determine if the number is odd
-   * @param number the number given
-   * @return true if the number is odd, false if it is even
-   */
-  public boolean isOdd(int number){
-      return false;
-  }
+    /**
+     * Determine if the number is odd
+     * @param number the number given
+     * @return true if the number is odd, false if it is even
+     */
+    public boolean isOdd(int number){
+        if (number % 2 == 1) {
+            return true;
+        } else {
+            return false;
+        }
+    }
 
-
-  /**
-   * Multiply the number by itself
-   * @param number the number given
-   * @return the result of the number multiply by itself
-   */
-  public int square(int number) {
-      return -1;
-  }
+    /**
+     * Multiply the number by itself
+     * @param number the number given
+     * @return the result of the number multiply by itself
+     */
+    public int square(int number) {
+        return (number * number);
+    }
 
 }

StringUtilities.java

@@ -1,13 +1,40 @@
 public class StringUtilities {
-   public Character getMiddleCharacter(String word){
-       return null;
-   }
-   
-   public String removeCharacter(String value, char charToRemove){
-     return null;  
-   }
-   
-   public String getLastWord(String value) {
-       return null;
-   }
+    public Character getMiddleCharacter(String word){
+        char midChar = word.charAt(word.length() / 2);       
+        return midChar;
+    }
+
+    public String removeCharacter(String value, char charToRemove){
+        StringBuilder sb = new StringBuilder();
+
+        for (int i = 0; i < value.length(); i++) {
+            if (value.charAt(i) == charToRemove) {
+                continue;
+            } else {
+                sb.append(value.charAt(i));
+            }
+        }
+
+        String newValue = sb.toString();
+
+        return newValue;  
+    }
+
+    public String getLastWord(String value) {
+        // Cycle through each element of the string.
+        // If the element is a space, the word is the space 
+
+        StringBuilder sbLastWord = new StringBuilder();
+
+        for (int i = value.length() - 1; i > 0; i--) {
+            if (value.charAt(i) == ' ') {
+                sbLastWord.append(value.substring(i + 1, value.length()));
+                break;
+            }
+        }
+
+        String lastWord = sbLastWord.toString();
+        
+        return lastWord;
+    }
 }

package.bluej

@@ -2,24 +2,24 @@
 dependency1.from=StringUtilitiesTest
 dependency1.to=StringUtilities
 dependency1.type=UsesDependency
-dependency2.from=BonusTest
-dependency2.to=Bonus
+dependency2.from=MathUtilitiesTest
+dependency2.to=MathUtilities
 dependency2.type=UsesDependency
-dependency3.from=MathUtilitiesTest
-dependency3.to=MathUtilities
+dependency3.from=LoopFunTest
+dependency3.to=LoopFun
 dependency3.type=UsesDependency
-editor.fx.0.height=722
-editor.fx.0.width=876
-editor.fx.0.x=158
-editor.fx.0.y=216
+editor.fx.0.height=883
+editor.fx.0.width=921
+editor.fx.0.x=323
+editor.fx.0.y=122
 objectbench.height=164
 objectbench.width=669
 package.divider.horizontal=0.6
 package.divider.vertical=0.7628294036061026
 package.editor.height=543
 package.editor.width=567
-package.editor.x=557
-package.editor.y=43
+package.editor.x=1002
+package.editor.y=209
 package.frame.height=779
 package.frame.width=693
 package.numDependencies=3
@@ -40,20 +40,19 @@ target1.width=110
 target1.x=110
 target1.y=150
 target2.height=50
-target2.name=BonusTest
+target2.name=LoopFunTest
 target2.showInterface=false
 target2.type=UnitTestTargetJunit4
-target2.width=80
-target2.x=120
-target2.y=270
-target3.association=BonusTest
+target2.width=110
+target2.x=10
+target2.y=240
 target3.height=50
-target3.name=Bonus
+target3.name=LoopFun
 target3.showInterface=false
 target3.type=ClassTarget
 target3.width=80
-target3.x=90
-target3.y=300
+target3.x=170
+target3.y=260
 target4.association=MathUtilitiesTest
 target4.height=50
 target4.name=MathUtilities