Merge branch 'neha-practice' of https://github.com/code4tomorrow/java into neha-practice

Author: neha-peddinti

src/com/codefortomorrow/advanced/chapter13/examples/IterToRecursive.java

@@ -9,10 +9,7 @@ public static void main(String[] args) {
 
         int a = 72, b = 20;
         while (a != b) {
-            if (a > b)
-                a -= b;
-            else if (b>a)
-                b -= a;
+            if (a > b) a -= b; else if (b > a) b -= a;
         }
         System.out.println("GCD:" + a);
 
@@ -23,20 +20,17 @@ else if (b>a)
     // Recursive function
     public static int power(int base, int exp) {
         // Base case: exp = 0, so the result is 1.
-        if(exp == 0)
-            return 1;
+        if (exp == 0) return 1;
 
         // Multiply once by the previous power.
-        return power(base, exp-1)*base;
+        return power(base, exp - 1) * base;
     }
 
     public static int gcd(int a, int b) {
         // Base case
-        if(a == b)
-            return a;
-        else if(a > b)
-            return gcd(a-b, b);
-        else
-            return gcd(a, b-a);
+        if (a == b) return a; else if (a > b) return gcd(
+            a - b,
+            b
+        ); else return gcd(a, b - a);
     }
 }

src/com/codefortomorrow/advanced/chapter13/practice/NegativeSum.java

@@ -10,14 +10,13 @@ public class NegativeSum {
     public static void main(String[] args) {
         System.out.println("Iterative:");
         int a = 50, b = 40;
-        while(a + b > 0) {
-            if(Math.pow(a, 2) + Math.pow(b, 2) > 10000) {
-               a *= 8; 
-               b *= -4;
-            }
-            else {
-               a *= 3;
-               b /= 2;
+        while (a + b > 0) {
+            if (Math.pow(a, 2) + Math.pow(b, 2) > 10000) {
+                a *= 8;
+                b *= -4;
+            } else {
+                a *= 3;
+                b /= 2;
             }
         }
         System.out.println("a + b: " + (a + b));
@@ -27,7 +26,6 @@ public static void main(String[] args) {
     }
 
     public static int negSum(int a, int b) {
-
         // Insert code here and change return statement.
         return 0;
     }

src/com/codefortomorrow/advanced/chapter13/solutions/NegativeSum.java

@@ -10,14 +10,13 @@ public class NegativeSum {
     public static void main(String[] args) {
         System.out.println("Iterative:");
         int a = 50, b = 40;
-        while(a + b > 0) {
-            if(Math.pow(a, 2) + Math.pow(b, 2) > 10000) {
-               a *= 8; 
-               b *= -4;
-            }
-            else {
-               a *= 3;
-               b /= 2;
+        while (a + b > 0) {
+            if (Math.pow(a, 2) + Math.pow(b, 2) > 10000) {
+                a *= 8;
+                b *= -4;
+            } else {
+                a *= 3;
+                b /= 2;
             }
         }
         System.out.println("a + b: " + (a + b));
@@ -27,11 +26,10 @@ public static void main(String[] args) {
     }
 
     public static int negSum(int a, int b) {
-        if(a + b <= 0)
-            return a + b;
-        if(Math.pow(a, 2) + Math.pow(b, 2) > 10000)
-            return negSum(a * 8, b * -4);
-        else
-            return negSum(a * 3, b / 2);
+        if (a + b <= 0) return a + b;
+        if (Math.pow(a, 2) + Math.pow(b, 2) > 10000) return negSum(
+            a * 8,
+            b * -4
+        ); else return negSum(a * 3, b / 2);
     }
 }

src/com/codefortomorrow/advanced/chapter14/examples/Throw.java

@@ -5,17 +5,15 @@ public class Throw {
     public static void main(String[] args) {
         try {
             System.out.println(divide(7, 2));
-        } catch(ArithmeticException e) {
+        } catch (ArithmeticException e) {
             System.out.println("There was an arithmetic exception.");
         }
     }
 
     public static int divide(int a, int b) {
         int result = a / b;
-        if(result != (double)a / (double)b)
-            throw new ArithmeticException();
+        if (result != (double) a / (double) b) throw new ArithmeticException();
         System.out.println("Got to end of divide()");
         return a / b;
     }
-
 }

src/com/codefortomorrow/advanced/chapter14/examples/Throws.java

@@ -1,4 +1,5 @@
 package com.codefortomorrow.advanced.chapter14.examples;
+
 import java.io.*;
 
 public class Throws {
@@ -7,13 +8,12 @@ public static void main(String[] args) {
         try {
             File file = null;
             access(file);
-        } catch(IOException e) {
+        } catch (IOException e) {
             System.out.println("There was an IOException.");
         }
     }
 
     public static void access(File file) throws IOException {
-        if(file == null)
-            throw new IOException();
+        if (file == null) throw new IOException();
     }
 }

src/com/codefortomorrow/advanced/chapter14/examples/UserExceptions.java

@@ -5,15 +5,14 @@ public class UserExceptions {
     public static void main(String[] args) {
         try {
             call(null);
-        } catch(MyException e) {
+        } catch (MyException e) {
             System.out.println("Caught MyException");
         }
 
         throw new ArithmeticException("divide by zero error");
     }
 
     public static void call(String s) throws MyException {
-        if(s == null)
-            throw new MyException();
+        if (s == null) throw new MyException();
     }
 }