Using recursion, write a Python function: def replace (A , d, e) which takes as input an array of integers A, and two integers d and e, and changes A by replacing every occurrence of d with e. For example, if A is the array [10,0,2,0],replace(A,0,5) should change A to [10,5,2,5]

Using recursion, write a Python function: def replace (A , d, e) which takes as input an array of integers A, and two integers d and e, and changes A by replacing every occurrence of d with e. For example, if A is the array [10,0,2,0],replace(A,0,5) should change A to [10,5,2,5]

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

Related questions

Q: Suppose you are to make change for the amount 1234 with the smallest possible number of coins. The…

A: The three recursive call will be if n is greater than or equal to 29, if n is smaller than 29 but…

Q: Write a recursive binary search procedure SEARCH (a, f, k) which looks for the element a at…

A: Please refer to the following step for the complete solution of the problem above.

Q: The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In…

A: Here is the Answer

Q: Write a Python function def isSubArray(A,B) which takes two arrays and returns True if the first…

A: def isSubArray(arr1, arr2, len1, len2): i = 0; j = 0 # Checking in both arrays together…

Q: a. Write a reduce-and-conquer recursive function FastRecSum()(C++ or python) that find the sum of…

A: The following code implements the above process:

Q: Suppose we have two arrays, a and b, containing numbers of size n and m, respectively. a and b…

A: - We need to code for the common element sum in the arrays.

Q: A number sequence, t(n), where n ≥ 1, is given by the following recursive algorithm, value a = 1, b…

A: Sequence Number a,b N value Formula to used && t value t(1) a=1, b=2 n=1 t=3*b+5…

Q: Let A[1...n,1...n] be a 2D array of positive integers with n rows and n columns. Let…

A: Answer :

Q: The binomial coefficient C(N,k) can be defined recursively as follows: C(N,0) = 1, C(N,N) = 1, and…

A: Answer is given below-

Q: write a c program for this: A run is a sequence of adjacent repeated values. Compute the length of…

A: Program description: n is the user input integer variable that stores the size of the user input…

Q: Write a python function that takes one integer (n) parameter and prints the first n digits from the…

A: Q1 def fib(n): if n<=1: return n else: return(fib(n-1)+fib(n-2))…

Q: The following function f uses recursion: def f(n): if n 0 a <- a + i + (i-1) return a f(n): arr[0]…

A: Asked question The following function f uses recursion:def f(n):if n <= 1return nelsereturn…

Q: Write a recursive function named decrypt, which takes a string s and a dictionary d where each key…

A: Actually, function is a group of statements.

Q: Write a recursive program to implement the randomized quick sort by considering the input as an…

A: package test; import java.util.Arrays; public class QuickSort{ public static void main(String…

Q: Below is the recursive implementation of binary search from lab with one change (in red): the print…

A: In this program, we are performing binary search,

Q: Write in python programming language: The Longest Subsequence Problem is a well-studied problem in…

A: Program def LIS(nums): tails =[0 for i in range(len(nums))] size = 0 for x in nums:…

Q: In the following recursive function, A is the input array with size n. RANDOM(n) produces a…

A: Solution:A) for loop iterates n times, and in each iteration of for loop , j is initialised to 1…

Q: Let us consider the problem of reversing the n elements of an array, A, so that the first element…

A: Java Code for above (with main method to test): class Prog{ //function to reverse the…

Q: A Draw the recursion trace for the execution of function ReverseArray(A,0,4) given bel on array A =…

A: Here in this code..(A, 0, 4) will be called..id condition will be true..so swap..again (A ,1,3) will…

Q: Given a real number a and a nonnegative integer n, find a,, using recursion an=2*an-1 + a2, for n≥2…

A: python recursive function: We know in Python that a function can call other functions. It is…

Q: using python In a jupyter notebook, implement a recursive function anagrams() that computes…

A: The answer is given below:-

Q: (Recursive binary search) The binary search algorithm given in this chapter is nonrecursive. Write…

A: Actually, c++ is a powerful general purpose language.

Q: Write a recursive binary search procedure SEARCH (a, f, k) which looks for the element a at…

A: SUMMARY: -Hence, we got the result

Q: Below is C code, and Python code, for the Selectionsort algorithm. The input is an array A of n…

A: ANSWER:-

Q: Write a program in C++ to copy the elements of an array into another by replacing every element with…

A: EXPLANATION: - float smallestOnLeft(float a[], int currIndex): - This function computes the…

Q: Show a complete run of Quicksort on the following array X : X: 1 2 3 4 5 6 7 8 9 10 17 5 -3 40 46 50…

A: Given array X: {1, 2 ,3 ,4 ,5 ,6, 7 ,8 ,9 ,10 17, 5, -3 ,40 ,46 ,50 ,16, 0, 22, 4}

Q: By Implement a recursive algorithm to find factorial of n,implement a recursive algorithm to find…

A: Given: By Implement a recursive algorithm to find factorial of n,implement a recursive algorithm to…

Q: Implement the recursive function int equal_pairs(int a[], int size). This function returns true if…

A: Answer:- i) Recursive function for the equal pairs : Approach :- Here the idea is to use a 2…

Q: Write a function to read elements of a N by N, 2 dimensional (2D) array and display the 2D array in…

A: Though main is itself a function, as it was specified i used an extra function and if you want all…

Q: Identify the recursive functions from the given code and give reasons why these functions are…

A: Explanation: Merge Sort works on the principle of divide and conquer rule. To sort a lengthy array,…

Q: Write pseudocode for a function Det-Quicksort(A, p, r)

A: Quicksort is divide and conquer base sorting techniques. The time taken: This is the best case…

Q: Write a recursive function that outputs the sequence of steps needed to solve the puzzle with n…

A: The current situation is to develop a c++ program that solves the puzzle game Tower of Hanoi using…

Q: In Python: Create one recursive function, rec_list(n), that takes in the user input n and returns…

A: range() The range() method returns an immutable sequence of numbers between the given start…

Q: Design and implement an algorithm using recursion and backtracking to sort an array of integers into…

A: Note: Since the language in the question is not defined so I am using python to implement this…

Q: a) Consider a recursive function to return the Number of Binary Digits in the Binary Representation…

A: Since you are asking multiple questions, we are doing first question for you. a. Given algorithm…

Q: Identify the recursive functions from the given code and give reasons why these functions are…

A: A recursive function is a function that calls itself during its execution. The process may repeat…

Q: (In python) Create a recursive function, rec_list(n), that takes in the user input n and returns an…

A: The term Reсursiоn саn be defined аs the рrосess оf defining sоmething in terms оf…

Q: You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes…

A: Below is the minmax algorithm using divide and conquer technique:

Q: Given an array A of type integer (Using C++): a) Ask the user to input the number of elements for…

A: #include <bits/stdc++.h>using namespace std; int maximum(int ank[], int nnk){ // base case…

Q: Write a function "sumofEven" that takes an int "n" and returns the sum of all even integers starting…

A: We have to write a function "sumOfEven" to find sum of even numbers from 1 to n we have given sample…

Q: implement QuickSort of ints that sorts the numbers in the non-decreasing order. Implement the…

A: As you have not specified the language in which you want the code. so i will provide the code in c++…

Q: The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In…

A: For your readability, extra \n is added at the end of each iteration and you can remove them if you…

Q: Given an unsorted array, A, of integers and an integer k, write a recursive java code for…

A: Actually, unsorted array is a data elements are arranged not in an order.

Q: Implement a recursive C++ function which takes an integer array (A) and the starting (start) and…

A: Lets analyze what information we are given and what is expected out of it. Required : Recursive C++…

Q: write a recursive function in F#, named indexWiseMax, that takes two list of integers and outputs…

A: In this program we have to perform the recursive programming Where, we have to match the index of…

Q: write java codes to do the following: Write a recursive function to check if an integer array is…

A: public class Main{ public static boolean checkArraySym(int [ ] A, int first, int last){…

Q: Write a recursive function sum that takes a two dimensional array and returns sum of its all…

A: Program plan:- 1. Include header file. 2. Function declaration for merge sort. 3. Recursive merge…

Q: Write a recursive function to implement the recursive algorithm of Exercise 16 (reversing the…

A: Program code: //include the required header files #include<iostream> #include<string>…

Concept explainers

Randomized Select Algorithm

A randomized algorithm is defined as one that uses a certain amount of randomization in its logic or operation. It is said to be an algorithm that depends on the random number to perform its operation. It is used for reducing the overall time complexity, space complexity in the standard algorithm. The randomized algorithm uses the concept of random numbers to find the solutions to the different kinds of problems and also to improve the problem solutions.

Question

Using recursion, write a Python function:
def replace (A, d, e)
which takes as input an array of integers A, and two integers d and e, and changes A by
replacing every occurrence of d with e.
For example, if A is the array [10,0,2,0],replace (A,0,5) should change A to [10,5,2,5].

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

code:

VIEW

output:

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a program using c# to do the following: Initialize an array A with 10 elements. Initialize an array B with 7 elements. Divide each element of array A with each element of array B that is a[0]/b[0] , a[1]/b[1] etc. Implement the same to handle divide by zero error and index out of bound error.
Write a Python function def isSubArray(A,B) which takes two arrays and returns True if the first array is a (contiguous) subarray of the second array, otherwise it returns False. You may solve this problem using recursion or iteration or a mixture of recursion and iteration. For an array to be a subarray of another, it must occur entirely within the other one without other elements in between. For example: [31,7,25] is a subarray of [10,20,26,31,7,25,40,9] [26,31,25,40] is not a subarray of [10,20,26,31,7,25,40,9] A good way of solving this problem is to make use of an auxiliary function that takes two arrays and returns True if the contents of the first array occur at the front of the second array, otherwise it returns False. Then, A is a subarray of B if it occurs at the front of B, or at the front of B[1:], or at the front of B[2:], etc. Note you should not use A == B for arrays.
PYTHON: create a function code(n) that sorts a list of words alphabetically using a RECURSIVE function. tip: a. check if the length of n = 1, if true, return n and stop b. else, if the length of n >= 1, do the ff: c. get the min(x) (least rank word in alphabetical order) d. create a new array from n, where the min is removed. The new array is m. e. return the array composed of the min + code(m).
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] Hint:The trick is to remove the last element each time to make the ArrayList a little shorter. import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum =…
Given an integer array of positive single digit values such as:int a[] = {8,4,2,6,9};1) Write a recursive arrayToN function which returns the concatenation of all array values as an integer value.This function should accept all required data as parameters and return a long integer value.ExamplesIf the array is 8 4 2 6 9 the arrayToN function returns the integer 84269.If the array is 0 2 6 8 9 3 5 1 the arrayToN function returns the integer 2689351.
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] ================================================ import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum = findMinimum(numbers);System.out.println("Minimum: " + minimum);}public static int…
Write a function that returns trueif the product of an array is divisible by the sum of that same array. Otherwise, return false. Example: divisible([3, 2, 4, 2]) →false WRITE IN PYTHON PLEASE
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 defined size . You have to Read the arrays n and r at run time. Compute n C r for each corresponding terms in the array ‘n’ and ‘r’, and display it properly formatted.
please code in python Write a recursive function reverse(sentence) for reversing a sentence. For example, reverse('Who let the dogs out?') will return '?tuo sgod eht tel ohW'. The idea is to remove the first or last letter, reverse the shortened sentence, and then combine the two parts.
Create a function that takes an array of positive and negative numbers. Return an array where the first element is the countof positive numbers and the second element is the sum of negative numbers. Example: countPosSumNeg ([4, 5, 7, -3, 7, -10, 2])→ [5, -13] WRITE IN PYTHON PLEASE
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
Without using Java environment Write a recursive function with two parameters: an array of ints and the number of elements in the array. The function will return the sum of all positive values in the array. Do not add any negative array elements to the sum. You can add another parameter to the function if you wish.