/**
* Recursion Lab.
* @author cs416
* @version 1
*/
public class Recursion {

    /**
    * Tests if a String is a Palindrome.
    * @param in The String to test
    * @return boolean
    */
    public static boolean isPalindrome(String in) {
	throw new UnsupportedOperationException("TO BE IMPLEMENTED");
    }

    /**
    * counts the frequency of the specified letter.
    * @param input The string to count the letter
    * @param letter The character to count
    * @return int
    */
    public static int countLetter(String input, char letter) {
	throw new UnsupportedOperationException("TO BE IMPLEMENTED");
    }

    /**
    * finds the maximum value in the array.
    * @param list The array to search for max value
    * @param n The window size of the array to search through
    * @return int
    */
    public static int maxValue(int[] list, int n) {
	throw new UnsupportedOperationException("TO BE IMPLEMENTED");
    }
}