myUtil

Class Recursion

java.lang.Object

myUtil.Recursion

public class Recursion
extends java.lang.Object

This Class contains some typical recursive functions. All of them are statics.

Author:

Chung-Chih Li

Constructor Summary

Constructors

Constructor and Description
Recursion()

Method Summary

Modifier and Type	Method and Description
static long	binaryToDecimal(java.lang.String str)
static int	bSearch(int[] a, int s, int e, int key)
static myUtilX.MySet<myUtilX.MySet<java.lang.Object>>	choose(int n, myUtilX.MySet<java.lang.Object> s)
static java.util.ArrayList<java.lang.String>	choose(int n, java.lang.String s)
static int	fibonacci(int n)
static int	fibonacciPower(int n)
static int	gcd(int a, int b)
static void	hanoi(int n, char S, char T, char X)
static void	main(java.lang.String[] args)
static boolean	palindrome(java.lang.String s)
static int[]	pascalTriangle(int n)
static java.util.ArrayList<java.lang.String>	permute(java.lang.String s)
static myUtilX.MySet<myUtilX.MySet<java.lang.Object>>	powerSet(myUtilX.MySet<java.lang.Object> s)
static java.util.ArrayList<java.lang.String>	powerSet(java.lang.String s)
static java.lang.String	reverse(java.lang.String s)
static void	testPascalTriangle()

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Recursion

public Recursion()

Method Detail

fibonacciPower

public static int fibonacciPower(int n)

fibonacci

public static int fibonacci(int n)

reverse

public static java.lang.String reverse(java.lang.String s)

palindrome

public static boolean palindrome(java.lang.String s)

gcd

public static int gcd(int a,
                      int b)

bSearch

public static int bSearch(int[] a,
                          int s,
                          int e,
                          int key)

pascalTriangle

public static int[] pascalTriangle(int n)

testPascalTriangle

public static void testPascalTriangle()

binaryToDecimal

public static long binaryToDecimal(java.lang.String str)

hanoi

public static void hanoi(int n,
                         char S,
                         char T,
                         char X)

Parameters:

n - number of disks to move.

S - is the label of the Source tower.

T - is the label of the Target tower.

X - is the intermediate tower.

permute

public static java.util.ArrayList<java.lang.String> permute(java.lang.String s)

powerSet

public static java.util.ArrayList<java.lang.String> powerSet(java.lang.String s)

choose

public static java.util.ArrayList<java.lang.String> choose(int n,
                                                           java.lang.String s)

powerSet

public static myUtilX.MySet<myUtilX.MySet<java.lang.Object>> powerSet(myUtilX.MySet<java.lang.Object> s)

choose

public static myUtilX.MySet<myUtilX.MySet<java.lang.Object>> choose(int n,
                                                                    myUtilX.MySet<java.lang.Object> s)

main

public static void main(java.lang.String[] args)