// Hunter Schafer, CSE 143
// Simple client program that compares iterative and recursive
// solutions to a problem
public class RecursionExample {
    public static void main(String[] args) {
        writeStars(3);
    }

    //     public static void writeStars(int n) {
    //         for (int i = 1; i <=n; i++) {
    //             System.out.print("*");
    //         }
    //         System.out.println();
    //     }


    // pre: n >= 0
    // prints n stars followed by newline
    public static void writeStars(int n) {
        if (n == 0) { // base case, simplest
            System.out.println();
        } else { // recursive case
            // n > 0
            System.out.print("*");
            // What's left? print n - 1 stars! If only we had a method!!!
            writeStars(n - 1);
        }
    }

}