Answered: Consider a function doubles::… | bartleby

C++ Programming: From Problem Analysis to Program Design

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 12PE

See similar textbooks

Related questions

Question

EXERCISE 1
Consider a function doubles :: Cint]Eint] that doubles every
item in
list
doubles [3, 4,1,2] [6,8, 2,4]
a) write a version doubles Rec using recursion for the aboe
function

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

30.// programming Write a function void reverse(int a[ ], int size) to reverse the elements in array a, the second parameter size is the number of elements in array a. For example, if the initial values in array a is {5, 3, 2, 0}. After the invocation of function reverse(), the final array values should be {0, 2, 3, 5} In main() function, declares and initializes an integer array a with{5, 3, 2, 0}, call reverse() function, display all elements in final array a. Write the program on paper, take a picture, and upload it as an attachment. Or just type in the program in the answer area. m861144 m861144
Language: JAVA Script Write a recursive function called 'shortestToLongest' which takes an array of lowercase strings and returns them sorted from shortest to longest. Strings of equal length should be sorted alphabetically. (Hint: stri <str2 will return true if str1 comes before str2 alphabetically) Your function should accept a default argument called 'sorted' which holds the currently sorted elements. Each recursive step should add the shortest string in the strings array to the end of 'sorted'. // Examples: // Sorts strings from shortest to longestlet strings1 = ["abc", "de", " ", "f", "ghijk", "Imno"] shortestToLongest (strings1);// [' ', 'f', 'de', 'abc', 'lmno', 'ghijk'] // Accepts a pre-sorted default parameter let strings2 = ["pomegranate", "persimmon", "peach"]; let sorted ["pea", "pear"];shortestToLongest (strings2, sorted); // ['pea", "pear', 'peach', 'persimmon', 'pomegranate'] // Sorts strings of the same length alphabetically let strings3 = ["dog", "cat",…
CodeW X bFor fun X C Solved x b Answer + x https://codeworko... CodeWorkout X265: Recursion Programmlng Exercise: GCD The greatest common divisor (GCD) for a pair of numbers is the largest positive integer that divides both numbers without remainder. For function GCD , write the missing base case condition and action. This function will compute the greatest common divisor of x and y.You can assume that x and y are both positive integers and that x > y. Greatest common divisor is computed as follows: = x and GCD(x, y) = GCD(y, x % y). Examples: GCD (6, 4) -> 2 Your An swer: 1 public int GCD(int x, int y) { if > { 2. > 3. } else { 4. return GCD(y, x % y); 9. { 7. 1:09 AM 50°F Clear 1V 1. 12/4/2021 甲
Use Array instead of vectors- Implement following classes and required member functions in C++ OOP style. A main function Introduce Movie object first. Then add several Movie objects along with necessary data ( Date, Title, Genre, category etc ) to array of movies. Movie class that has functions to add and delete movies.a. Introduce a searchEvent(by category/title/year etc) which will print out all movies of a specified search. Perform deletion and insertion operations. Introduce sort movies function by year, title and category and display. Introduce private members of your choice and use Setter and/or getter functions extract and modify these data members. Then please make sure you invoke all functions in main function. Fast answer please
C. In permutations and combinations, the term “n C r” refers to n combinationstaken r at a time.??? =?!/?! (? − ?)!Write a recursive function to find the factorial of a number.Use the defined function to compute the term “nCr” for the following scenario:The values of ‘n’ and ‘r’ are stored in two parallel arrays of any user definedsize . You have to Read the arrays n and r at run time. Compute n C r for eachcorresponding terms in the array ‘n’ and ‘r’, and display it properly formatted.Also your program should print the current date and time using libraryfunctions
Write a function that takes in an integer n and computes n!. Do this without recursion. In [ ]: deffactorial_iter(n):"""Takes in an integer n>0 and returns the product of all integers from 1 to n."""# YOUR CODE HEREraiseNotImplementedError() In [ ]: In [ ]: assert factorial_iter(6) == 720 assert factorial_iter(7) == 5040 assert factorial_iter(10) == 3628800
Problem 1: Recursion to Generator You worked with these last homework. For this homework, you'll write the tail recursion, while, and generator. This is a reminder that in the starter code, we are providing you with the regular recursion code, and the functions you must implement must utilize tail recursion, a while loop, or a generator as specified. In your starter code, function names will end in _t, _w, or _g if the function needs to be implemented using tail recursion, a while loop, or a generator, respectively. Review the lecture slides to learn more about generators. p(0) p(n) = 10000 = p(n-1) + 0.02p(n − 1) c(1) = 9 c(n) = 9c(n-1) + 10-1 — c(n − 1) d(0) = 1 d(n) = 3d(n-1) + 1 Programming Problem 1: Recursion to Generators • For reach function you'll write the tail recursive form, while, and generator. • We have added the signature to help you-in particular, c(n) requres two accumula- tors. (1) (2) (3) (4) (5) (6) (7)
/** numUnique returns the number of unique values in an array of doubles. * The array may be empty and it may contain duplicate values. * Unlike the previous questions, you can assume the array is sorted. * * Your solution should contain at most one loop. You may not use recursion. * Your solution must not call any other functions. * Here are some examples (using "==" informally): * * * * * Ⓒ == numUnique (new double[] { }) 1 == numUnique (new double[] {11}) 1 == numUnique (new double[] { 11, 11, 11, 11 }) 8 == numUnique (new double[] { 11, 11, 11, 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88, 88 }) 8 == numUnique (new double[] { 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88 }) * */ public static int numUnique (double[] list) { return StdRandom.uniform (100); //TODO: fix this
c++ hw In this hw, you're going to be working with partially filled arrays that are parallel with each other. That means that the row index in multiple arrays identifies different pieces of data for the same person. This is a simple payroll system that just calculates gross pay given a set of employees, hours worked for the week and hourly rate. code format: // TODO: Add function prototypes for all the declared functions // TODO: Declare two functions to compute the highestPay and lowestPay// HINT: Each should return the index of the correct value in the grossPay array. /* TODO: Create a function calledgetEmployeeNames Arguments : Name array(first and last name) Maximum size Return the number of names filled.*/ /* TODO: Create a function calledgetHourlyPay Arguments : NameArray(filled in Step 1) HourlyPayArray(starts empty) NumberOfNamesFilled(from Step1)*/ int main(){ // TODO: Declare an array of strings for the employeeNames able to hold a…
4. CodeW X For func X C Solved b Answer x+ https://codeworkou... ... [+) CodeWorkout X271: Recursion Programming Exercises: Minimum of array For function recursiveMin, write the missing part of the recursive call. This function should return the minimum element in an array of integers. You should assume that recursiveMin is initially called with startIndex = 0. Examples: recursiveMin({2, 4, 8}, 0) -> 2 Your Answer: 1 public int recursiveMin(int numbers[], int startIndex) { numbers.length - 1) { if (startIndex 2. return numbers[startIndex]; } else { return Math. min(numbers[startIndex], >); 5. { 1:11 AM 50°F Clear 12/4/2021
Part 5: Programming exercise (Optional) Write a recursive program called generateSum to read a positive integer N from user input and output all possible combination of two or more numbers which sum of the numbers is N. You can use function such as void genNum (int N, int N, String output). Example run: Enter number: 4 4 31 22 211 1111 Enter number: 6 6 51 42 411 33 321 3111 222 2211 21111 111111
### Q7: Set to Numbers def create_n_to_tuple(): """Tuple to Integer In set theory, we can represent natural numbers recursively initially with empty sets. https://en.wikipedia.org/wiki/Set-theoretic_definition_of_natural_numbers We will use tuple in place of set to implement this representation. you will define two functions n_to_tuple and tuple_to_n, and return two function. The functions' specification is: n_to_tuple Args: n (int): an integer. Returns: t (tuple): tuple representation of the integer. None if integer cannot be represented. tuple_to_n Args: t (tuple): tuple representation of the integer Returns: n: integer which t represents -1 if tuple is invalid. # We will implement a time test on this function. >> n_to_tuple, tuple_to_n = create_n_to_tuple() >> n_to_tuple(0) () >> n_to_tuple(1) ((),) >> n_to_tuple(2) ((), ((),)) >>> r = n_to_tuple(-1) >>> print(r) None >> tuple_to_n(((), (),), (),)), ((), (),)))) # invalid -1 ### Modify your code here return ### Modify your code here

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS