What does this function do?SOURCE CODE1.int T(int x, int y)2.3.int sum4.if (odd (x)) |l odd (m) is true if and only 11 // x is an odd number5.sum = y;6.7.while (x > 1) {8.9.;2/X =אy = 2*y:if (odd (x))10.11.12.sum += y;13.14.return sum;15. )

C++ CODE #include <iostream>using namespace std;int T(int x,int y){ int sum=0;…

Answered: (7 What does this function do? SOURCE…

(7 What does this function do? SOURCE CODE 1. int T(int x, int y) 2. 3. int sum 0; 4. if (odd (x)) // odd (m) is true if and only 11

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Write these in Pseudocode #1a – In pseudocode, write a call to a function that passes 1 Integer variable and 1 Integer array, and saves a Boolean value in return. #1b – In pseudocode, write the function that accepts 1 Integer and 1 Integer array and returns a Boolean. In the function, search the Integer array with a for-loop, and if the Integer parameter is found in the array, return false. If the Integer parameter is not found, return true. #2a – In pseudocode, write a call to a module that passes 1 Integer variable, 1 Real variable, 1 String constant, and 1 String literal as arguments. #2b – In pseudocode, write the module header that accepts 1 Integer, 1 Real, and 2 Strings as parameters. #3 – This pseudocode has multiple problems. Fix the calling statement and the definition below so that the routine accepts 3 grades as parameters and returns the average into a variable.…
IS IT CORRECT? Write a function to show the max number in ten input numbers. Answer: #include <iostream> #include <algorithm> using namespace std; int numbers[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; int maxNumber = *max_element(numbers, numbers + 10); int findMax(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j) { int max = a; if (b > max) { max = b; } if (c > max) { max = c; } if (d > max) { max = d; } if (e > max) { max = e; } if (f > max) { max = f; } if (g > max) { max = g; } if (h > max) { max = h; } if (i > max) { max = i; } if (j > max) { max = j; } return max; } int main() { cout << findMax(1, 2, 3, 4, 5, 6, 7, 8, 9, 10) << endl; return 0; }
what could go wrong with the function show on the right? (tip: syntax error is not the answer) void goo(unsigned int n) { if (n==0) return; cout << n; goo(n-2); }
please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.
True or False?14. Consider the function f : D → C where A, B ⊆ D. If f[A] − f[B] = ∅ then f[A − B] = ∅.
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
c++ Implement a function that recursively calculates the nth number in the Fibonacci sequence of numbers. The Fibonacci sequence starts at 0 and 1. Each number thereafter is the sum of the two preceding numbers. This gives us the following first ten numbers: 0,1,1,3,5,8,13,21,34, .... Input Expected output0 01 17 139 34
What does the function return for any positive values of x and n ? The answer should be a general formula in terms of x and n. int what_do_I_do ( int x, int n ) { if ( n = = 1 ) return x; else return x + what_do_I_do ( x, n – 1 ); } C++ be quick please
python code. Instructions for each function are given within the quotations. 1)def is_word_from_letters(word, letters): """ Returns True if word is spelled by rearrange all or some of the letters Otherwise returns False Notes: this is different from uses_only function we wrote before, word not only can use only characters in letters, but the number of times it can use a letter is also limited by what is in letters. For example: is_word_from_letters("book", "bok") should be False because we do not have enough letter 'o'. """ return True 2)def get_word_score(word, value_dict): """ Given a word, and a dictionary matching each letter to an int score, calculates the word's score (adding up each letter's score) and return the score. """ return 0 3)def get_legal_word_scores(letters, dictionary, value_dict): """ Given a str of letters that we can use, and a dictionary that contains all legal words allowed in scrabble game, and a value_dict that maps each letter to a score, Returns a…
Write a function that keeps computing the sum of the digits of x^n, until there is only one digit left. For example, sumOfDigits(2,5) returns 5, because 2 ^ 5 = 32 = 3 + 2 = 5 Another example, sumOfDigits(2,8) returns 4, because 2 ^ 8 = 128 = 1 + 2 + 8 = 13 = 1 + 3 = 4
Write a function sum_of_digits(a,b), that takes two arguments a and b, computes a to the power of b, then recursively finds the sum of digits until there is only one digit left. You must PRINT all steps of the process as shown in the below example. sum_of_digits(5,3) will PRINT on the screen the following: 5ˆ3 = 125 = 1 + 2 + 5 = 8 sum_of_digits(2,8) will PRINT on the screen the following: 2ˆ8 = 256 = 2 + 5 + 6 = 13 = 1 + 3 = 4
Hi, im making a ladders and chutes game. can someone help me make this into a function which i can call in the game to check if a player landed on any of these squares. Thanks int snakes[100] = {0}; int ladders[100] = {0}; snakes[31] = 11; snakes[23] = 16; snakes[19] = 7; snakes[45] = 20; snakes[61] = 49; snakes[39] = 30; ladders[11] = 26 ; ladders[3] = 22 ; ladders[20] = 29 ; ladders[5] = 8 ; ladders[50] = 60; ladders[80] = 92;