Non-recursive Iteration and Recursion/Lab1.c
unsigned long long int power(unsigned int a, unsigned int b){
    unsigned long long int results = 1; //results init. to 1 because 1^n is still 1
    
    //determines the results of a^b by iteration
    for(unsigned int i = 0; i < b; i++){
        results *= a;
    }
    
    return results;
}
/*
  power: calcualtes the power of a given integer but a given integer
  Input: 2 integers; a,b where a is powered by b
  Output: results (the power of a by b)
*/
calcualtes the power of a given integer but a given integer
Input: 2 integers; a,b where a is powered by b
Output: results (the power of a by b)
calcualtes the power of a given integer but a given integer Input : 2 integers ; a b where a is powered by b Output : results ( the power of a by b )
unsigned long long int power(unsigned int a, unsigned int b){
    unsigned long long int results = 1; 
    for(unsigned int i = 0; i < b; i++){
        results *= a;
    }
    return results;
}
unsigned long long int power ( unsigned int a , unsigned int b ) { unsigned long long int results = 1 ; for ( unsigned int i = 0 ; i < b ; i ++ ) { results *= a ; } return results ; }
power: calcualtes the power of a given integer but a given integer
Input: 2 integers; a,b where a is powered by b
Output: results (the power of a by b)
power : calcualtes the power of a given integer but a given integer Input : 2 integers ; a b where a is powered by b Output : results ( the power of a by b )
//results init. to 1 because 1^n is still 1 //determines the results of a^b by iteration