Advertisement
Guest User

Untitled

a guest
May 21st, 2018
121
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.81 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. void factorialRecursion (int n, int& value) {
  6.     if (n != 1){
  7.         value *= n;
  8.         factorialRecursion(--n, value);
  9.     }
  10. }
  11.  
  12. int factorial (int n) {
  13.     if (n <= 0)
  14.         return 0;
  15.  
  16.     int value = 1;
  17.     factorialRecursion(n, value);
  18.  
  19.     return value;
  20. }
  21.  
  22. void powerRecursion (int number, int& n, int& value) {
  23.     if (n != 1) {
  24.         value *= number;
  25.         powerRecursion(number, --n, value);
  26.     }
  27. }
  28.  
  29. int power (int number, int n) {
  30.     if (n == 0)
  31.         return 1;
  32.  
  33.     int value = number;
  34.  
  35.     powerRecursion(number, n, value);
  36.  
  37.     return value;
  38. }
  39.  
  40. float series (float x, int n) {
  41.     int value = 2;
  42.     float sum = 1;
  43.  
  44.     while (value != 2 * n) {
  45.         sum += power(x, value) / factorial(value);
  46.  
  47.         value += 2;
  48.     }
  49.  
  50.     return sum;
  51. }
  52.  
  53. int main () {
  54.     cout << series(2, 8) << endl;
  55.  
  56.     return 0;
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement