<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                ThinkChat2.0新版上線,更智能更精彩,支持會話、畫圖、視頻、閱讀、搜索等,送10W Token,即刻開啟你的AI之旅 廣告
                # C 程序:使用遞歸查找數字的階乘 > 原文: [https://www.programiz.com/c-programming/examples/factorial-recursion](https://www.programiz.com/c-programming/examples/factorial-recursion) #### 在此示例中,您將學習查找用戶使用遞歸輸入的非負整數的階乘。 要理解此示例,您應該了解以下 [C 編程](/c-programming "C tutorial")主題: * [C 函數](/c-programming/c-functions) * [C 用戶定義的函數](/c-programming/c-user-defined-functions) * [C 遞歸](/c-programming/c-recursion) * * * 正數`n`的階乘由下式給出: ```c factorial of n (n!) = 1 * 2 * 3 * 4 *... * n ``` 負數的階乘不存在。`0`的階乘為`1`。 在此示例中,您將學習使用遞歸查找數字的階乘。 訪問此頁面以了解如何使用循環查找數字的[階乘](https://www.programiz.com/c-programming/examples/factorial)。 * * * ## 使用遞歸的階乘 ```c #include<stdio.h> long int multiplyNumbers(int n); int main() { int n; printf("Enter a positive integer: "); scanf("%d",&n); printf("Factorial of %d = %ld", n, multiplyNumbers(n)); return 0; } long int multiplyNumbers(int n) { if (n>=1) return n*multiplyNumbers(n-1); else return 1; } ``` **輸出** ```c Enter a positive integer: 6 Factorial of 6 = 720 ``` * * * 假設用戶輸入了 6。 最初,從`main()`調用`multiplyNumbers()`,并將 6 作為參數傳遞。 然后,將 5 從相同的函數傳遞給`multiplyNumbers()`(遞歸調用)。 在每個遞歸調用中,參數`n`的值減小 1。 當`n`的值小于 1 時,沒有遞歸調用,并且階乘最終返回給`main()`函數。
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看