Scribd Logo
Upload

Welcome to Scribd!

  • Functie Recursiva Iterativa

    Uploaded by

    Adriana
    7 views1 page
    This document defines two functions, fact1 and fact2, that calculate the factorial of a given number. fact1 uses recursion by multiplying the current number by the factorial of the previous number until it reaches 1. fact2 uses a for loop to multiply all numbers from 1 to the given number together. The main function calls both functions to calculate the factorial of 5 and prints the results.

    Original Description:

    SDA - Curs 1

    Original Title

    FunctieRecursivaIterativa

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines two functions, fact1 and fact2, that calculate the factorial of a given number. fact1 uses recursion by multiplying the current number by the factorial of the previous number until it reaches 1. fact2 uses a for loop to multiply all numbers from 1 to the given number together. The main function calls both functions to calculate the factorial of 5 and prints the results.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Functie Recursiva Iterativa

    Uploaded by

    Adriana
    This document defines two functions, fact1 and fact2, that calculate the factorial of a given number. fact1 uses recursion by multiplying the current number by the factorial of the previous number until it reaches 1. fact2 uses a for loop to multiply all numbers from 1 to the given number together. The main function calls both functions to calculate the factorial of 5 and prints the results.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    1: #include <iostream>

    2: #include <stdlib.h>
    3:
    4: using namespace std;//pt scrierea prescurtata, fara std::cout, etc
    5:
    6: int fact1(int n)//varianta recursiva
    7: {
    8: int raspuns;
    9:
    10: if(n == 1) return(1);
    11: raspuns = fact1(n-1)*n;
    12: return(raspuns);
    13: }
    14:
    15:
    16: int fact2(int n)
    17: {
    18: int raspuns = 1;
    19: for(int i = 1; i <= n; i++) raspuns = raspuns *i;
    20: return(raspuns);
    21: }
    22:
    23:
    24: int main()
    25: {
    26:
    27: cout << fact1(5) << "\t" << fact2(5) << endl;
    28:
    29:
    30: system("PAUSE");//in stdlib
    31: return 0;
    32: }
    33:
    34:
    35:
    36:
    37:
    38:

    You might also like