Recursion | Recursion on Arrays | Max Value | Sum of arrays | Lecture 32 | Java & DSA Course
J A V A C O D E
1. Write a program to print all the values in an Array Recursively
</> RecArrayPrinting.java
- // Printing ARRAY elements :
- package Recursion;
- import java.util.Scanner;
- public class RecArrayPrinting {
- public static void print(int[]arr,int n){
- if(n==0) return ;
- print(arr,n-1);
- System.out.print(arr[n-1]+" ");
- }
- public static void main(String[] args) {
- Scanner sc=new Scanner(System.in);
- System.out.println("Enter no. of elements: ");
- int n=sc.nextInt();
- int []arr=new int[n];
- for(int i=0;i<n;i++)
- arr[i]=sc.nextInt();
- print(arr,n);
- sc.close();
- }
- }
2. Write a program to find the Maximun value in an Array by Recursively
</> RecArrayMaxFnd.java
- // FINDING MAXIMUM OF ARRAY :
- package Recursion;
- import java.util.Scanner;
- public class RecArrayMaxFnd {
- public static void fndMax(int []arr,int n,int max){
- if(max<arr[n]) max=arr[n];
- if(n==0){
- System.out.println("Max. value of this array is: "+max);
- return;
- }
- fndMax(arr,n-1,max);
- }
- public static void main(String[] args) {
- Scanner sc=new Scanner(System.in);
- System.out.println("Enter no. of elements: ");
- int n=sc.nextInt();
- int []arr=new int[n];
- for(int i=0;i<n;i++)
- arr[i]=sc.nextInt();
- int max=arr[n-1];
- fndMax(arr,n-2,max);
- sc.close();
- }
- }
3. Write a program to find the Sum of all elements in an Array by Recursively
</> RecArraySum.java
- // FINDING SUM OF ALL ELEMENT IN AN ARRAY :
- package Recursion;
- import java.util.Scanner;
- public class RecArraySum {
- public static int addAll(int []arr,int n,int sum){
- sum=sum+arr[n];
- if(n==0) return sum;
- return addAll(arr,n-1,sum);
- }
- public static void main(String[] args) {
- Scanner sc=new Scanner(System.in);
- System.out.println("Enter no. of elements: ");
- int n=sc.nextInt();
- int []arr=new int[n];
- for(int i=0;i<n;i++)
- arr[i]=sc.nextInt();
- int ans=addAll(arr,n-2,arr[n-1]);
- System.out.println(ans);
- sc.close();
- }
- }
😎 SEE YOU AGAIN !!
Comments
Post a Comment