Using the functional programming language RACKET solve the following problem: The prime-factors function takes an integer n as input (n į 0) and returns a list containing the prime factors of n in ascending order. Prime factors are the prime numbers that divide a number exactly. If all the prime factors are multiplied, the original number is obtained.

Using the functional programming language RACKET solve the following problem: The prime-factors function takes an integer n as input (n į 0) and returns a list containing the prime factors of n in ascending order. Prime factors are the prime numbers that divide a number exactly. If all the prime factors are multiplied, the original number is obtained.

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

Given: List L of pairs of characters String S Output: TRUE if S is a valid string, FALSE otherwise. A string is considered valid if each character in the string can be paired with another character in the string, where the pair belongs to the input list L. Furthermore, two pairs cannot cross each other. In other words, a pair most completely enclose another, or be completely separate. Design and implement an efficient dynamic programming solution to this problem. Examples: Input L: (a b) (b c) (c d) (a a) Input S: aaba Output: True (pairs shown color-coded: aaba, “aa” fully encloses “ab”) Input L: (a b) (b c) (c d) (a a) Input S: abcaad Output: True (pairs shown color-coded: abcaad, “ab” is separate from the other pairs) Input L: (a b) (b c) (c d) (a a) Input S: acbd Output: False (acbd is not valid because the pairs cross each other.) Input L: (a b) (b c) (c d) (a a) Input S: aaac Output: False Could you please provide python implementation to this?
Given: List L of pairs of characters String S Output: TRUE if S is a valid string, FALSE otherwise. A string is considered valid if each character in the string can be paired with another character in the string, where the pair belongs to the input list L. Furthermore, two pairs cannot cross each other. In other words, a pair most completely enclose another, or be completely separate. Design and implement an efficient dynamic programming solution to this problem. Examples: Input L: (a b) (b c) (c d) (a a) Input S: aaba Output: True (pairs shown color-coded: aaba, “aa” fully encloses “ab”) Input L: (a b) (b c) (c d) (a a) Input S: abcaad Output: True (pairs shown color-coded: abcaad, “ab” is separate from the other pairs) Input L: (a b) (b c) (c d) (a a) Input S: acbd Output: False (acbd is not valid because the pairs cross each other.) Input L: (a b) (b c) (c d) (a a) Input S: aaac Output: False
SML programming Write a recursive function np(n) which takes a non negative n and generates a list of numbers from n+1 down to 0. You may assume that input of n is always valid. Must use identical function name and parameter(s). np(4)⟶[5,4,3,2,1,0]
Write a recursive function count_odds (Ist) which takes as parameter a list of numbers (Ist) and counts the odd numbers in it. Example: >>> count_odds ([2, 5, 7, 6, 4]) 2
CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021
Exercise 1: The number of combinations CR represents the number of subsets of cardi- nal p of a set of cardinal n. It is defined by C = 1 if p = 0 or if p = n, and by C = C+ C in the general case. An interesting property to nxC calculate the combinations is: C : Write the recursive function to solve this problem.
The Lucas numbers are a series of numbers where the first two Lucas numbers (i.e., at indices 0 and 1) are 2 and 1 (respectively) and the kth Lucas number L_k (where k>1) is L_(k-1) + L_(k-2). Consider the following recursive definition for a function that is supposed to find the nth element of the Lucas numbers. Select the best option that identifies the line of code that prevents this function from running recursively and provides the correct code. Question options: line 5 should be return recursive_function(n-1) + recursive_function(n-2) line 3 should be return [2,1][n-1][n-2] line 3 should be return [2,1][n-1] line 2 should be if n <= 2: line 5 should be return recursive_function(n-1 + n-2) None of these options
A palindrome is any word, phrase, or sentence that reads the same forward and backward. Here are some well-known palindromes:Able was I, ere I saw ElbaA man, a plan, a canal, PanamaDesserts, I stressedKayakWrite a bool function that uses recursion to determine if a string argument is a palindrome. The function should return true if the argument reads the same forward andbackward. Demonstrate the function in a program.
[Unbalanced Rod] Given a set of n weights {w₁,..., wn} and a rod of length n - 1 inches, we can attach the weights to the rod at hooks placed at one inch distances apart as shown in the figure below. -1". /10 2 3 12 2 4 We can attach a weight to any hook but no two weights can be attached to the same hook and we have to attach all the weights. For any given assignment of weights to hooks, we can compute the location of the center of mass of the rod and the weights according to the following equation (neglecting the weights of the rod and the hooks). where 0 ≤ Pi≤n-1 is the position of weight along the rod. For example, in the figure shown above, the center of mass is computed as C= C = i Wi Pi Σi Wi 10 0+2 1+3·2+4·3+12.4 +2.5 10+2+3+4+12+2 78 33 The problem is to find an assignment of weights to hooks that makes the center of mass as far as possible to the left, i.e., minimize the value of c. Answer the following questions. 1. Describe a greedy algorithm that finds the assignments that…
In programming, a recursive function calls itself. The classical example is factorial(n), which can be defined recursively as n*factorial(n-1). Nonethessless, it is important to take note that a recursive function should have a terminating condition (or base case), in the case of factorial, factorial(0)=1. Hence, the full definition is: factorial(n) = 1, for n = 0 factorial(n) = n * factorial(n-1), for all n > 1 For example, suppose n = 5: // Recursive call factorial(5) = 5 * factorial(4) factorial(4) = 4 * factorial(3) factorial(3) = 3 * factorial(2) factorial(2) = 2 * factorial(1) factorial(1) = 1 * factorial(0) factorial(0) = 1 // Base case // Unwinding factorial(1) = 1 * 1 = 1 factorial(2) = 2 * 1 = 2 factorial(3) = 3 * 2 = 6 factorial(4) = 4 * 6 = 24 factorial(5) = 5 * 24 = 120 (DONE) Exercise (Factorial) (Recursive): Write a recursive method called factorial() to compute the factorial of the given integer. public static int factorial(int n) The recursive algorithm is:…
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: **** *** ** * ** *** ****
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…