Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function (defun gcd (n m) "Returns the gcd of two numbers" (let ((dividend n) (divisor m) (remainder 1)) (while (/= remainder 0) (setq remainder (mod dividend divisor)) (setq dividend divisor) (setq divisor remainder)) dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.

Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function (defun gcd (n m) "Returns the gcd of two numbers" (let ((dividend n) (divisor m) (remainder 1)) (while (/= remainder 0) (setq remainder (mod dividend divisor)) (setq dividend divisor) (setq divisor remainder)) dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Implement a recursive C++ function which takes two integers num and den as arguments and returns theinteger quotient that will result when num is divided by den. The prototype of your function should be:int quotient (int num, int den)Hint: Think about repeated subtraction
Write a function in c called recursively_reverse_string() that accepts a pointer to a string as a parameter, and any other parameters you see fit, recursively reverses the string, and returns a pointer to the reversed string. For example, the reversed string of input “string” is “gnirts”.
Write a C++ recursive function PrintPattern3 to print following pattern using recursion. No loops allowed whatsoever, and you can write maximum two functions apart from main function. For example, calling your function with these argument PrintPattern1(1,5) should print following pattern. Your function prototype must be as follows recursive function.void PrintPattern3(int start, int end);
Write in C++ a polymorphic and recursive function, print(x, n, w),which can print an object, x, the given number of times, n, separated by the user’s choice of white space character, w.Both n and w must be “default arguments”. The default value of “n” must be 1 and the default value of “w” must be the space character.(1) (2) (3)NB: If any part of your solution to a question has been extracted from a book, past tests or exams, then full disclosure must be given with complete references to the source. Non-disclosures will carry heavy penalties.
Write a function decimal_to_binary(decimal_number) that takes in a non-negative integer and returns it in binary as an integer representation. Solve this problem using recursion. Use a helper function (with extra parameters) to handle the recursion.
What is the return value of the function call Comp(4, 5), given the recursive function Comp defined below: int Comp(int a, int b) { if (a + b <= 6) return 3; else return Comp(a-1, b) + Comp(a, b-1); }
Write a function decimal_to_binary(decimal_number) that takes in a non-negative integer and returns it in binary as an integer representation. Solve this problem using recursion. Use a helper function (with extra parameters) to handle the recursion. Examples decimal_to_binary(7) should return 111 decimal_to_binary(128) should return 10000000 decimal_to_binary(5) should return 101 Make sure your function signature matches the given function decimal_to_binary(decimal_number) because I will be using unit tests to evaluate your code. Return an integer representing the binary number from the function, not a string representation. Python
Write a Haskell recursive function pascal() that takes an integer n as input and returns a list containing the sequence of numbers appearing in the nth line of Pascal’s triangle. Use function ZIP for returning a list.
for C++ write a progam for the greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y. The gcd of x and y is defined recursively as follows. If y is 0 the answer is x; otherwise gcd(x, y) is gcd(y, x%y).
Write a recursive C function that returns the capital letters of a string str. The prototype of function must be: void F(char *str, *char cap); The capital letters of string must be saved in string cap.
Write a recursive function called that takes a string of single names separated by spaces and prints out all possible combinations (permutations), each combination on a new line. When the input is: Alice Bob Charlie then the output is: Alice Bob Charlie Alice Charlie Bob Bob Alice Charlie Bob Charlie Alice Charlie Alice Bob Charlie Bob Alice Here is my original code that needs to be fixed: def all_permutations(permList, nameList): # TODO: Implement method to create and output all permutations of the list of names. if nameList == len(permList) - 1: return nameList else: for x in range(permList, len(nameList)): permList[nameList], permList[x] = permList[x], permList[name_List] return all_permutations(permList, nameList + 1) permList[nameList], permList[x] = permList[x], permList[name_List] if __name__ == "main": nameList = input().split(' ') permList = [] all_permutations(permList, nameList)
Write a C++ recursive program that checks if two vectors of type int are anagrams of each other. You are not allowed any additional functions except vector functions. Using loops is also prohibited. bool isAnagram(vector a, vector b, startindex=0) You can use only this additional function: bool isFound(const vector &a, const int &x) { for (int i = 0; i < a.size(); i++) if (a[i] == x) return true; return false; }