added comments

Author: Ram swaroop

src/me/ramswaroop/strings/StringPermutationCount.java

@@ -9,9 +9,19 @@
  * @author: ramswaroop
  * @date: 10/15/15
  * @time: 10:32 AM
+ * @see: me.ramswaroop.strings.StringPermutations for a simpler version
  */
 public class StringPermutationCount {
 
+    /**
+     * Finds the number of permutations of string {@param s1} that exists in string {@param s2}.
+     *
+     * @param prefix
+     * @param s1
+     * @param s2
+     * @param count
+     * @return
+     */
     public static int getStringPermutationCount(String prefix, String s1, String s2, int count) {
         if (s1.isEmpty()) {
             if (s2.indexOf(prefix) != -1) count++;
@@ -26,6 +36,6 @@ public static int getStringPermutationCount(String prefix, String s1, String s2,
 
     public static void main(String a[]) {
         System.out.println(getStringPermutationCount("", "abc", "abcba", 0));
-        System.out.println(getStringPermutationCount("", "abc", "abcba", 0));
+        System.out.println(getStringPermutationCount("", "abc", "abcbacb", 0));
     }
 }

src/me/ramswaroop/strings/StringPermutations.java

@@ -8,6 +8,7 @@
  * @time: 2:27 PM
  * @see: http://www.ericleschinski.com/c/java_permutations_recursion/
  * @see: http://introcs.cs.princeton.edu/java/23recursion/Permutations.java.html
+ * @see: me.ramswaroop.strings.StringPermutationCount for a modification of this problem
  */
 public class StringPermutations {