


How to calculate the factorial of a given number n through a PHP program
In the previous article "PHP Loop Learning 9: Obtaining the greatest common divisor between given two numbers", we introduced the use of while loop statements to find the greatest common divisor between given two integers. Method, this time we will talk about factorial and introduce how to calculate the factorial of a given integer N. Interested friends can learn about it~
First of all, let’s understandWhat is factorial?
The factorial of a positive integer is the product of all positive integers less than and equal to the number. Therefore, the factorial of a given integer N is:
1 × 2 × 3×...× (n-1) × n
Finding the factorial is simple , is a programming problem that students who are just starting to program will definitely encounter, and there are many ways to implement it. This article will introduce you to various methods of implementing factorial from the perspective of for loop, while loop, do-while loop, and recursion.
Method 1: Use a for loop to implement the factorial of N
Implementation idea:
Because finding the factorial of n is Find the product of 1 times 2 times 3...all the way up to n. Therefore, the initial condition of the for loop can be set to
i = 1
, and the restriction condition can bei or <code>i . <br>
Then the loop body is the multiplication operation. Multiply the i value of each loop to get a product
-
Finally output the product
Let’s take a look at the implementation method:
<?php header("Content-type:text/html;charset=utf-8"); //第一种方法--for循环 function Factorial($n) { $sum = 1; for ($i = 1; $i <= $n; $i++) { $sum *= $i; } echo "$n 的阶乘为: " . $sum."<br><br>"; } Factorial(5); Factorial(10); Factorial(100); ?>
$sum *= $i
The statement is equivalent to $sum=$sum*$i
, *=
The assignment operator can multiply the variable on the left side of the operator by the value of the expression on the right side and assign it to the variable on the left. Note: Since any value multiplied by 0 is 0, the initial value of the variable $sum must be 1.
Let’s take a look at the output results:
#We understand how the for loop implements the factorial of N. The implementation methods of the while loop and do-while loop are also That’s almost all I know (their implementation thinking is the same).
Method 2: Use a while loop to implement the factorial of N
<?php header("Content-type:text/html;charset=utf-8"); //第二种方法--while循环 function Factorial($n) { $i = 1; $sum=1; while($i<=$n){ $sum*=$i; $i++; } echo "$n 的阶乘为: " . $sum."<br><br>"; } Factorial(1); Factorial(2); Factorial(3); Factorial(11); ?>
Output result:
Method 3: Use do-while loop to implement the factorial of N
<?php header("Content-type:text/html;charset=utf-8"); //第三种方法--do while循环 function Factorial($n) { $i = 1; $sum=1; do { $sum *= $i; $i++; } while ($i <= $n); echo "$n 的阶乘为: " . $sum."<br><br>"; } Factorial(2); Factorial(3); Factorial(4); Factorial(10); ?>
Output result:
Compare method 1, method 2 and method 3. Did you find that they are very similar!
Okay, here comes another important point. Let’s take a look at how recursion implements the factorial of N.
Method 4: Use recursion to implement the factorial of N
So what is recursion? Simply put, recursion means that the program calls itself and the function keeps referencing itself until the referenced object is known. The following two conditions must be met to constitute recursion:
The subproblem must be the same thing as the original problem and simpler.
You cannot call yourself without limit, there must be an exit, and it can be simplified to non-recursive situation processing.
According to recursive thinking, factorial can be expressed by the following formula:
f(1) = 1 f(n) = n * f(n-1) {n>1}
Therefore, the code to use PHP to recursively find N factorial is as follows:
<?php header("Content-type:text/html;charset=utf-8"); //第四种方法--递归 function Factorial($n) { $sum=1; if($n <= 1){ return 1; }else{ $sum = $n * factorial($n-1); return $sum; } } echo "2 的阶乘为: " .Factorial(2)."<br><br>"; echo "3 的阶乘为: " .Factorial(3)."<br><br>"; echo "4 的阶乘为: " .Factorial(4)."<br><br>"; echo "10 的阶乘为: " .Factorial(10); ?>
Output result:
Okay, that’s all. If you want to know anything else, you can click this. → →php video tutorial
Recommended: 《PHP interview questions summary (collection)》
The above is the detailed content of How to calculate the factorial of a given number n through a PHP program. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.
