Write a C++ function factorial that takes an integer, n, and returns the value of n factorial (a.k.a., n!): When n is positive, n! = 1 * 2 * 3 * ... * n. For example, 5! = 1 * 2 * 3 * 4 * 5 = 120. When n is zero, n! is defined to be 1. When n is negative, n! is undefined. You may assume that the parameter n will not be negative for this problem.

Write a C++ function factorial that takes an integer, n, and returns the value of n factorial (a.k.a., n!): When n is positive, n! = 1 * 2 * 3 * ... * n. For example, 5! = 1 * 2 * 3 * 4 * 5 = 120. When n is zero, n! is defined to be 1. When n is negative, n! is undefined. You may assume that the parameter n will not be negative for this problem.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.2: Returning A Single Value

Problem 14E

See similar textbooks

Similar questions

In C, write a function that gets two ints a and b. If a>b the function returns a^3 + b^2, and otherwise it returns a^2 + b^3. int square_cube (int a, int b); For example: square_cube (1,2) should return 1 + 8 = 9. square_cube (10, 3) should return 1000 + 9 = 1009. square_cube (2, -1) should return 8 + 1 = 9. square_cube (-2, -1) should return 4 - 1 = 3.
Write a C++ function that accepts a double typed number and return back the fractional part of the number. For example, if the number is 789.123, the number 0.123 should be returned.
First write a function f to generate and return a random number between 0 to 100 In the main function, you keep calling function f until the returned value is less than 10 Then you should print out how many times the function f has been called. Note that every time f will only return a single random number, and the declaration of f is as follows: int f() For instance, if f returns 23, 89, 10, 1, then your program should print 4 on the screen. C++ language Hint 1. You can implement the function using different methods, like the static variable Hint 2. You can use the modular operator to shrink the generated random value, i.e., random() % 101 will guarantee the result is between 0 and 100.
In C++, m%n is the remainder when the integer m is divided by the integer n. We can define a function to test whether an integer is even as follows: bool even(int k) { if ( k % 2 == 1 ) return false; else return true;} Translate this function into a standard mathematical function specification.
The question should be done in C++, please give explanation and running result. 1. Let’s write a function that compares 2 strings and returns true if they were identical, false otherwise. The signature of this function should be: bool word_diff(std::string word1, std::string word2); For example: std::string str1 = "Hello World";std::string str2 = "hEllO World";std::string str3 = "World";std::string str4 = "Hello World";bool result = word_diff(str1, str2); // Falsebool result = word_diff(str1, str3); // Falsebool result = word_diff(str1, str4); // True 2. Now let’s follow a classical approach to compare the content of 2 files. We should open each file, read their content word by word and compare them until a first mismatch occurs.Let’s implement a function called classical_file_diff that takes 2 arguments each of which is a file name and returns a boolean indicating whether the 2 files are identical or not. The signature of this function should be: bool…
Q3: Write a complete C++ program that contains the integer functions (main, funx and funy). The main function declares an integer (k), which is assigned a value using cin. Then print funx(k), where funx(n)=2*funy(n-1) if n >1 and funx(n)=1 if n<=1. And funy(n)=3*funx(n-1)-1 if n>1 and funy(n)=1 if n<=1. *
Write a C programs that reads three sides of a triangle and then: 1) determines if these numbers give you a "valid" triangle 2) uses a formula to calculate the area. For above 1 and 2 you must write a function. Use these example numbers as minimum to test your program: 10,10,20 10.12.20 HINT: Partial code for 1) bool is_Valid(double side1, double side2, double side3) { if( side1 + side2 > side3 && ..... Partial code for 2) double area_triangle(double side1, double side2, double side3) { double area = 0; double s = (side1 + side2 + side3)/2; area = sqrt(s*(s - side1)*(s - side2)*(s - side3)); ..... .... .... MAIN: if (is_Valid(side1,side2,side3)) { myarea = area_triangle(side1,side2,side3); }
Write a C programs that reads three sides of a triangle and then: 1) determines if these numbers give you a "valid" triangle 2) uses a formula to calculate the area. For above 1 and 2 you must write a function. Use these example numbers as minimum to test your program: 10,10,20 10.12.20 HINT: Partial code for 1) bool is_Valid(double side1, double side2, double side3) { if( side1 + side2 > side3 && ..... Partial code for 2) double area_triangle(double side1, double side2, double side3) { double area = 0; double s = (side1 + side2 + side3)/2; area = sqrt(s*(s - side1)*(s - side2)*(s - side3));
In C++ just do the problems in simple, not complicated code. Even if a problem does not directly tell you to use a function, you should aim to do so regardless. 1. Create a function that takes in a number n and outputs all the odd numbers from 1 to n. 2. Create a function that takes in a int number and outputs each of the digits backwards 3. Create a function that counts backwards from 100 to 1. 4. If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Find the sum of all the multiples of 3 or 5 below 1000. Use a function to do this. Return the total to main.
In C++ Write a program that prints the count of all prime numbers between A and B (inclusive), where A and B are defined as follows: A = 12345 B = A + 5000 Note: A prime number is any number, greater or equal to 2, that is divisible ONLY by 1 and itself. Here are the first 10 prime numbers: 2, 5, 7, 11, 13, 17, 19, 23, and 29. Rules: You should first create a boolean function called isPrime and use that function in your program. This function should take in any int and return true if the number is prime, otherwise, return a false. In the main body of your program, you should create a loop from A to B (inclusive) and use isPrime function to determine if the loop number should be counted or not. Your program SHOULD NOT PRINT the individual prime numbers. You can print them for your own testing purpose, but in the final submission, comment out such print statements. Your program SHOULD ONLY PRINT the answer -- which is a number. Do not print extra characters in your answer (E.g.…
Write a function in C programming language that gets two ints x and y, and returns the sum of all ints between x and y, including them. int sum_interval(int x, int y); For example: - sum_interval(1, 4)returns 1+2+3+4=10. - sum_interval(10, 3)returns 3+4+5+6+7+8+9+10=52. - sum_interval(2, -1)returns (-1)+0+1+2=2. - sum_interval(-1, -1)returns -1. Note that we may have x>=y or x<=y. You may assume that the sum will be within the range of int.
Write a C++ program that reads three sides of a triangle and then: 1) determines if these numbers give you a "valid" triangle 2) uses a formula to calculate the area. For above 1 and 2 you must write a function. Use these example numbers as minimum to test your program: 10,10,20 10.12.20 HINT: Partial code for 1) bool is_Valid(double side1, double side2, double side3) { if( side1 + side2 > side3 && ..... Partial code for 2) double area_triangle(double side1, double side2, double side3) { double area = 0; double s = (side1 + side2 + side3)/2; area = sqrt(s*(s - side1)*(s - side2)*(s - side3)); ..... .... .... MAIN: if (is_Valid(side1,side2,side3)) { myarea = area_triangle(side1,side2,side3); }