Lab1_q1

#include <iostream>
using namespace std;

int factorial(int n){
    if (n<0){
        return -1;
    }else{
        int result = 1;
        for(int i=1;i<=n;i++){
            result *= i; 
        }
        return result;
    }
}

int main() {
    //Q1. Create a different 'int factorial(int n)', one that does NOT use recursion.
    cout << factorial(6) << endl;
}