factorial function implement using recursion
public int factorial(int num) { if (num == 0) return 1; else return (num * factorial(num - 1)); }