Write a recursive function that lists al of the two-element subsets of a given set of letters in the folowing format. For example, when twoElementSubsets takes "ACEG" as parameter, it wil print twoelement-subsets in the folowing format (A. C) (A, E) (A, G) (C. E) (c, G) E. G) Write a C program to test your function. Read the string (a set of letters) from he user. The number of parameters that twoElementSubsets function may take depends on your reaunsive function de sign. Sample Ingutt ACEG Sample Outputi (A C) (A E) (A G) (C, E) (C. G) (E. G) Sample Input EDCBA Sample Output2: (E. D) (E. C) (E, B) (E. A) (D. C) (D. B) (D. A) (C, B) (C. A) (B. A) For additional samples, please look at the input/output fles.

Write a recursive function that lists al of the two-element subsets of a given set of letters in the folowing format. For example, when twoElementSubsets takes "ACEG" as parameter, it wil print twoelement-subsets in the folowing format (A. C) (A, E) (A, G) (C. E) (c, G) E. G) Write a C program to test your function. Read the string (a set of letters) from he user. The number of parameters that twoElementSubsets function may take depends on your reaunsive function de sign. Sample Ingutt ACEG Sample Outputi (A C) (A E) (A G) (C, E) (C. G) (E. G) Sample Input EDCBA Sample Output2: (E. D) (E. C) (E, B) (E. A) (D. C) (D. B) (D. A) (C, B) (C. A) (B. A) For additional samples, please look at the input/output fles.

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

Write a recursive function using python for the problem: A palindrome is a sequence of characters which is the same when the sequence is reversed. Given an array A indexed from p to q containing characters, determine if the sequence of characters in A[p..q] forms a palindrome. Return True is a palindrome is formed and return False if it does not.
In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()
Implement a recursive C++ function which takes an array of integers (arr) and the starting (start) andending (end) indices of a portion (part) of this array, and returns the index of thelargest element present in that portion of array arr. The prototype of your function should be:int findLargest (int* arr, int start, int end) For example, the function call findLargest(arr,3,8)should determine and return the index of the largest element present in the array arr between the indices 3and 8 (both inclusive)
Implement a recursive C++ function which takes a character (ch) and a positive integer (n) and prints thecharacter ch, n times on the screen. The prototype of your function should be:void printChar (char ch, int n)For example, calling printChar('*',5) should display ***** on screen.Note: There should NOT be any loop in your function.
Write a recursive function concat str(st) which takes as parameter a list of strings (Ist) and returns a string resulting from concatenating all the items in Ist.
a) Write a non-recursive function in C++/ to multiply all even numbers from 2 to n, where n is an input to the function, and n>=2. (reminder: An even number is divisible by 2 and generates a remainder of 0. for example 2,4,6,... are even numbers). b) Analyze your algorithm in part (a) in the worst-case. Show all your work. Then express the time as Big-O().
Below,enter code to complete implementation of a recursive function sum_all_integers(), which takes an input n and adds all intergers preceding it, up to n: add_all_integers(n):
Write a function(in pyhton) that RECURSIVELY merges the characters in two given strings in alphabetical order. For example, mergeTwoString(("aghp","bdct") results "abcdghpt".
Write a recursive function that, given a sequence of comparable values, returns the count of elements where the current element is less than the following ( next ) element in the given sequence. See the examples given below. def count_ordered ( seq ) : """ Input : A sequence of comparable elements Output : The number of elements that are less than the following element in the sequence Example : >>> count_ordered ( [ 1 , 2 , 3 , 4 , 5 , 6 ] ) 5 >>> count_ordered ( ( 1 , 12, 7.3 , -2,4 ) ) 2 >>> count_ordered ( 'Python' ) 2 >>> count_ordered ( [ 6 ] ) 0 >>> count_ordered ( [ ] ) 0 """ In the first example above , count_ordered ( [ 1,2,3,4,5,6 ] )the returned answer is 5 because for all the first 5 numbers the current number is less than the next number. In the second example above, count_ordered ( ( 1,12,7.3 , -2,4 ) )the…
Write a recursive C++ program to find the GCD of two numbers and using this write a function to find the L.C.M of two numbers in O(1) time. GCD function should contain one line of code. Please answer only if you can fulfill the conditions else I will downvote.
Write an iterative function that determines the number of even elements in an array a of integers of size n. The function should return the number of elements that are even in array a of size n. Propose an appropriate prototype for your function and then write its code. Write a recursive function to solve the above problem. Propose an appropriate prototype for your function and then write its code.
Lee has discovered what he thinks is a clever recursive strategy for printing the elements in a sequence (string, tuple, or list). He reasons that he can get at the first element in a sequence using the 0 index, and he can obtain a sequence of the rest of the elements by slicing from index 1. This strategy is realized in a function that expects just the sequence as an argument. If the sequence is not empty, the first element in the sequence is printed and then a recursive call is executed. On each recursive call, the sequence argument is sliced using the range 1:. Here is Lee’s function definition: def printAll(seq): if seq: print(seq[0]) printAll(seq[1:]) Write a program that tests this function and add code to trace the argument on each call. Does this function work as expected? If so, are there any hidden costs in running it?