import java.util.Scanner; public class Main { public static void main(String[] args) { int n; Scanner sc=new Scanner(System.in); System.out.print("Enter the number of elements : "); //reading the number of elements n=sc.nextInt(); int[] a = new int[100]; //creates an array in the memory of length 100 System.out.println("Enter the elements of the array: "); for(int i=0; i

Implement your algorithm from the code above in java, so as to print out the time taken. Try various inputs and comment on whether your experimental results support your analyzed time complexity from basic operation for your algorithm. You should plot your runtime for various N to see if it corroborates your theoretical analysis. With a screenshot

Thank you so much

import java.util.Scanner; - public class Main { public static void main(String[] args) { int n; Scanner sc=new Scanner(System.in); System.out.print("Enter the number of elements : "); 1/reading the number of elements n=sc.nextInt(); int[] a = new int[100]; //creates an array in the memory of length 100 System.out.println("Enter the elements of the array: "); for(int i=0; i