1) Make up a recursion, compute its first five values, and look it up on The Online Encyclopedia of Integer Sequences.

Write a short recursive C++ program that will rearrange an array of int values so that all the even values appear before all the odd values.

Python Using recursion only! No loops or global var! return the largest number not print! Using such len(), isdigit() def getMaxDigit(phrase):

Write a program in Python that converts Euclid’s algorithm to find the greatest common divisor (GCD) of two positive integers to a recursive function named gcd.

Write a Program to implement binary search using recursion.

Using recursion, write a Python function def before(k,A) which takes an integer k and an array A of integers as inputs and returns a new array consisting of all the integers in A which come before the last occurrence of k in A, in the same order they are in A. For example, if A is [1,2,3,6,7,2,3,4] then before(3,A) will return [1,2,3,6,7,2]. If k does not occur in A, the function should return None.

Write a C++ program using classes and recursion functions to covert a number in a given base (the user enters the base - from 2 to 9) to a decimal number. The algorithm states that each successive digit in the number is multiplied by the base raised to the power corresponding to its position in the number. The low-order digit is in position 0. We sum together all of these products to get the decimal value. For example, in binary- base 2, if we have the binary number 111001, we convert it to decimal as follows: 1x25 + 1x2* + 1x23 + 0x22+ 0x22 + 1x2o = 57 For a base 5 number, 14230: 1x5 + 4x53 + 2x52 + 3x5+ Ox5° = 1190 Validate your input. You should check for invalid digits and provide an informative error message to the user. This program requires you to use a recursive function for the conversion to decimal. Failure to do that will result in no points awarded.

Give a recursive definition for the set of all strings of a’s and b’s that begins with an a and ends in a b. Say, S = { ab, aab, abb, aaab, aabb, abbb, abab..} Let S be the set of all strings of a’s and b’s that begins with a and ends in a b. The recursive definition is as follows – Base:... Recursion: If u ∈ S, then... Restriction: There are no elements of S other than those obtained from the base and recursion of S.

In C#, how would you compile a program that declares a 5 element double array that uses a loop to read values for each element from the user. The program should then use an additional loop to compute and output the sum of the elements in the array.

Solve the recursion by substitution: T(n) = 3T(n/2)+ 5n where T(1)=1

Finish the splitOdd10 using recursion to determine if the elements of an array can be split into two groups such that the sum of one group is a non-zero multiple of 10 and the sum of the other group is odd

solve by hand do not use code