Home > Java > Java Program to find factorial of a given number without recursion – Q2

Java Program to find factorial of a given number without recursion – Q2

January 1, 2009 Leave a comment Go to comments

Q2: Java Program to find factorial of a given number without recursion

The factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n.

For example:
5! =     5*4*3*2*1 = 120
6! = 6*5*4*3*2*1 = 720

class fact{
	public static void main(String args[]){
		int num;
		long fac = 1;
		num = Integer.parseInt(args[0]);
		for(int i=1; i<=num; i++){
			fac *= i;
		}
		System.out.println("Factorial of " + num + " is: " + fac);
	}
}

… from College notes (BCA/MCA assignments):

Categories: Java Tags: ,
  1. No comments yet.
  1. No trackbacks yet.

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.