Given an integer n, you can do the followingreplacement operations:1. Replace n with n/2 if n is even2. Replace n with either n - 1 or n + 1 if n isoddGiven an integer n, determine the minimumnumber of replacements needed to reach 1?For example, if n = 50, then we need aminimum of 7 replacements, as follows:50divide by 2→2550add 123-Another example, if n = 23, then we need aminimum of 6 replacements, as follows:divide by 2subtract 124Output:2412divide by 2divide by 2126Please use recursion to solve this task and doNOT use loops.Sample Testcase 0:Input:dividedivide by 2 2350Output:7add 12324Please use recursion to solve this task and doNOT use loops.Sample Testcase 0:Input:Sample Testcase 1:Input:Output:6divide by 212CodeBox1divide by 26divide by 2import java.util.Scanner;

the algorithm: 1. if n=1 then return 0 2. if n is even then call the function…

Given an integer n, you can do the following replacement operations: 1. Replace n with n/2 if n is even 2. Replace n with either n - 1 or n + 1 if nis odd Given an integer n, determine the minimum number of replacements needed to reach 1? For example, if n = 50, then we need a minimum of 7 replacements, as follows: divide by 2 50 add 1 23- 50 25 Another example, if n = 23, then we need a minimum of 6 replacements, as follows: divide by 2 24 Output: subtract 1 24 12 divide by 2 divide by 2 12 6 Please use recursion to solve this task and do NOT use loops. Sample Testcase 0: Input: divi divide by

Given an integer n, you can do the following replacement operations: 1. Replace n with n/2 if n is even 2. Replace n with either n - 1 or n + 1 if nis odd Given an integer n, determine the minimum number of replacements needed to reach 1? For example, if n = 50, then we need a minimum of 7 replacements, as follows: divide by 2 50 add 1 23- 50 25 Another example, if n = 23, then we need a minimum of 6 replacements, as follows: divide by 2 24 Output: subtract 1 24 12 divide by 2 divide by 2 12 6 Please use recursion to solve this task and do NOT use loops. Sample Testcase 0: Input: divi divide by

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 7PE

See similar textbooks

Similar questions

Using dynamic programming, it is often possible to change an iteration overpermutations into an iteration over subsets1. The benefit of this is that n!, thenumber of permutations, is much larger than 2n, the number of subsets. Forexample, if n = 20, then n! ≈ 2.4·1018 and 2n ≈ 106. Thus, for certain values of n,we can efficiently go through the subsets but not through the permutations. As an example, consider the following problem: There is an elevator withmaximum weight x, and n people with known weights who want to get from theground floor to the top floor. What is the minimum number of rides needed if thepeople enter the elevator in an optimal order?
For any even integer n, it is always possible to find a pair ofintegers m and k such that n = m × 2k, where m is the smallest integer.1. Write an algorithm that finds a factorization of any even integer n as stated above.For instance, we have the following two factorizations:48 = 3 × 24 instead of 48 = 12 × 2252 = 13 × 22 instead of 52 = 26 × 2.2. Analyze the time of your algorithm by computing the number of its multiplications. Show
The Virtual Weight (VW) of an integer number (which consists of more than 1 digit) is the sumof the individual digits that are composing the number. For example, consider the followingtwo numbers; 5638 and 1145, then the VW of each is calculated as following:VW(5638) = 5+6+3+8 = 22VW(1145) = 1+1+4+5 = 11Then, the VW can be classified as L (mean Low) or H (means High) using a specific cut-offvalue. For example, if the cut-off value is 15, then the VW of the number 5638 is H (High),and the VW of the number 1145 is L because 22 > 15 and 11 ≤ 15 respectivelyWrite a C++ program that: reads a positive integer n (where 5≤n≤20) from the user. If the user enters invalidnumber, then the program should continue prompting until he/she enters a valid numberwithin the specified range. Then, the program should generate n random numbers using the built-in rand()function. Every time a random number is generated, the program will classify that number as Lor H using the above method. Use a…
What are the complexities of the following code segments in terms of n? Give an upper bound. a) int i=1;while (i<= n) { int j = i; while (j > 0) j = j/2;i++; } b) int i,j s=0; for (i=0; i<n; i++) { i--; s++; if (s == n) { i++; s = 0; } } c) while (n > 0) { for (int i=0; i<n; i++) sum++; n = n/2; }
Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. You MUST choose your answer from the following (not given in any particular order), each of which could be reused (could be the answer for more than one of a) – f)): O(N2), O(N3 log N), O(N log N), O(N), O(N2 log N), O(N5), O(2N), O(N3), O(log N), O(1), O(N4), O(NN), O(N6)
Suppose that f(n) is defined to be n/2 if n is even, and 3n + 1 if n isodd. It is known that for small values of n (less than 1040) the sequenceof values generated by repeated application of f starting at n eventuallyreaches 1. Consider all the sequences generated from n < 10, 000. Whatare the maximum values encountered?
To calculate N to the power of M, we need to multiply N by M times. But this calculation is not efficient because we have to multiply everything one by one. For example, if the value of M is thousands, then we need to repeat it thousands of times, even though the calculation can only be done dozens of times using the decomposition technique. Offer an algorithm to calculate N to the power of M fasterlefficiently using a decomposition technique!
Given an integer array [A], efficiently find a descending sorted triplet such that: A[i]> A[i]> A[k] and 0 <=i<j <k <n, where n is the array size. For example, Input: A[] = {9, 1, 6, 7, 3, 4, 5) Output: Any one of the following triplets: (9, 7,5) (9, 7, 4) (9, 7, 3) (9, 6, 5) (9, 6, 4) (9, 6, 3) a) Design a brute-force algorithm to solve this problem complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity and analyse the complexity of your solution. c) Develop a python code to implement your efficient algorithm. depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
we consider a problem where we are given a set of coins andour task is to form a sum of money n using the coins. The values of the coins arecoins = {c1, c2,..., ck}, and each coin can be used as many times we want. Whatis the minimum number of coins needed?For example, if the coins are the euro coins (in cents){1,2,5,10,20,50,100,200}and n = 520, we need at least four coins. The optimal solution is to select coins200+200+100+20 whose sum is 520.
Given 2 sorted arrays (in increasing order), find a path through the intersection that produces the maximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from the array with greater sum. Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81
What is the worst case size of SL and SR (in terms of n) when you divide a list of unsorted items of size n into groups of (2*9)+1 while selecting a pivot? Input your answer as a decimal to three places. E.g. 3n/8 would be 0.375
Let A = {4, 5, 11, 16}, B = {6, 8, 11, 12, 13, 16}, C = {2, 3, 5, 7, 11},D = {8, 12, 16}, E = {6, 11, {12, 13}, 16}, F = {n ∈ Z | 1 ≤ n ≤ 12, and n is prime}. (Note: you can take multiple questions from my cycle if u want)