comment corrections

Author: Ram swaroop

src/me/ramswaroop/arrays/EquilibriumIndex.java

@@ -34,7 +34,7 @@ public static int getEquilibriumIndex(int[] a) {
         }
 
         for (int i = 0; i < a.length; i++) {
-            totalSum -= a[i]; // totalSum now holds the right sum
+            totalSum -= a[i]; // totalSum now holds the right sum from ith index to end
             if (leftSum == totalSum) {
                 return i; // left sum == right sum
             }

src/me/ramswaroop/arrays/SubsetOfArray.java

@@ -16,8 +16,8 @@ public class SubsetOfArray {
      * <p/>
      * Explanation: The below method uses sorting + merge method of merge sort. Time
      * complexity is O(mlogm + nlogn) where m and n are lengths of array a and b resp.
-     * You could also have used sorting + binary search but this fails when superset
-     * array has repeating elements for example, a={1,4,4,2} and b={1,4,2}. Time 
+     * You could also have used sorting + binary search but this fails when array
+     * {@param b} has repeating elements for example, a={1,4,2} and b={1,4,4,2}. Time 
      * complexity would be O(mlogm + nlogm).
      *
      * @param a