Question

In java 1. Write a recursive algorithm to add all the elements of an array of...

In java

1. Write a recursive algorithm to add all the elements of an array of n elements

2. Write a recursive algorithm to get the minimum element of an array of n elements

3. Write a recursive algorithm to add the corresponding elements of two arrays (A and B) of n elements. Store the results in a third array C.

4. Write a recursive algorithm to get the maximum element of a binary tree

5. Write a recursive algorithm to get the number of elements of a binary tree

Homework Answers

Answer #1

1. Write a recursive algorithm to add all the elements of an array of n elements

static int Cal_Sum(int arr[], int n) 
{ 
    if (n <= 0)     // base condition
        return 0; 
    return (Cal_Sum(arr, n - 1)+arr[n - 1]);   // recursive call
}

2. Write a recursive algorithm to get the minimum element of an array of n elements

public static int find_MAX(int arr[], int n) 
{ 
    if(n == 1) // base condition 
    return arr[0];  
    return Math.max(arr[n-1], find_MAX(arr, n-1));   //recursive call
} 

3. Write a recursive algorithm to add the corresponding elements of two arrays (A and B) of n elements. Store the results in a third array C.

static int[] fun(int a[], int b[],int c[],int n)
{
    if(n==0)    //base condition
    return c;
    c[n-1]=a[n-1]+b[n-1];   //add sum to c array 
    return fun(a,b,c,n-1);   //recursive call
}

4. Write a recursive algorithm to get the maximum element of a binary tree

static int MAX_ELEMENT(Node node) 
{ 
    if (node == null)             // base condition
        return Integer.MIN_VALUE; 
    int ans = node.data; 
    int left_ans = MAX_ELEMENT(node.left);   //recursive call
    int right_ans = MAX_ELEMENT(node.right); //recursive call
    if (right_ans > ans)         // finding max
        ans = right_ans;
    if (left_ans > ans)          // finding max
        ans = left_ans; 
    
    return ans; 
} 

5. Write a recursive algorithm to get the number of elements of a binary tree

static int Count_Nodes(Node root)
{
    if(root==null)  //  base condition
        return 0;
    return (1 + Count_Nodes(root.left) + Count_Nodes(root.right));  //recursive call
}

If you have any doubt please ask in comment.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Write a recursive algorithm in a pseudo code, Min-Max, for finding both the minimum and the...
Write a recursive algorithm in a pseudo code, Min-Max, for finding both the minimum and the maximum elements in an array A of n elements. Your algorithm calls itself only once within the algorithm and should return a pair (a, b) where a is the minimum element and b is the maximum element. Algorithm Min-Max(A, n) Input: an Array A of n elements Output: a pair of (a, b) where a is the minimum element and b is the maximum...
3. (10 marks) Describe a recursive algorithm for finding the maximum element in a array A...
3. Describe a recursive algorithm for finding the maximum element in a array A of n elements. Analyze its time complexity using a recursion tree.
Write a Java program that asks the user to enter an array of integers in the...
Write a Java program that asks the user to enter an array of integers in the main method. The program should prompt the user for the number of elements in the array and then the elements of the array. The program should then call a method named isSorted that accepts an array of and returns true if the list is in sorted (increasing) order and false otherwise. For example, if arrays named arr1 and arr2 store [10, 20, 30, 41,...
Write a Java method to print the maximum and minimum value of an array containing elements...
Write a Java method to print the maximum and minimum value of an array containing elements [7,20,29,0,4,30,24,100]
1.        A. Write a recursive brute force algorithm that calculates an. B. Write the java code...
1.        A. Write a recursive brute force algorithm that calculates an. B. Write the java code that does the calculation. C. What is the recurrence relation for the number of multiplications? D. What is the efficiency class of the algorithm?
IN JAVA: Write recursive method to return true if a given array has element equal to...
IN JAVA: Write recursive method to return true if a given array has element equal to employee emp, or returns false otherwise. Array can be empty or not. //PRECONDITION: Varible n denotes the number of occupied positions in the array and must be non-negative. Employee class has method getSalary() that returns employee's salary, // and it has method boolean equals(Employee emp) that accept an employee object and returns true if employee calling the equals method is equal as employee emp,...
IN PYTHON 4) Write an algorithm for a function called add3D which takes 2 parameters: two...
IN PYTHON 4) Write an algorithm for a function called add3D which takes 2 parameters: two different, non-jagged 3D sequences. You may assume that the arrays are the same size and contain compatible types. The function should create a new sequence of the appropriate size, add the two elements at the corresponding spots together, store them in the new 3D array, and return the new 3D array. NOTE: This may be done in pseudo-code or the language of your choice
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number...
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number in A and an O(log n)-time computation for each odd number in A. What is the best-case running time of Algorithm X? What is the worst-case running time of Algorithm X? 2. Given an array, A, of n integers, give an O(n)-time algorithm that finds the longest subarray of A such that all the numbers in that subarray are in sorted order. Your algorithm...
Write a PHP code that: 1- Creates an array that holds 10 random integer numbers between...
Write a PHP code that: 1- Creates an array that holds 10 random integer numbers between 1 and 100. 2- Moves all multiple of 3-numbers in the array that created in part-a into a new array. 3- Moves all multiple of 5-numbers in the array that created in part-a into a new array. 4- Find the maximum and the minimum multiple of 3-numbers, if exist. 5- Find the maximum and the minimum multiple of 5-numbers, if exist. 6- Prints the...
Using Java write all 4 methods in one class 1) Write a value-returning method that returns...
Using Java write all 4 methods in one class 1) Write a value-returning method that returns the number of elements in an integer array. 2) Write a void method that multiples by 2 all the elements in an array of float. 3) Write a value- returning method that returns the product of all elements in an integer array. 4) Write a method that returns the total # of elements greater or equal to 90 in an array of integers.