Question

Java question

Given an array of integer numbers, write a linear running time complexity program in Java to find the stability index in the given input array. For an array A consisting n integers elements, index i is a stability index in A itf ATO] + A[1] + +A[iI-1] Ali+1]+ Ali+2] +... + A[n-1]; where 0 <i< n-1 Similarly, 0 is an stability index if (A[1] A[2]A[n-1]) 0 and n-1 is an stability index if (A[0] A[1]+... A[n-21) 0 Example: Consider the array A 10, -3, 5, -4, -2, 3, 1, 0). The stability index found at index 0,3 and 7. Important Notes: You must add the main method in your program in order to test your implementation. .There are no data errors that need to be checked as all the data will be assumed correct. . You can use the array of the previous example to test your prdgram, however, I suggest that you also use other input arrays to validate the correctness and efficiency of your solution. . Your program MUST be submitted only in source code form (.java file). .A program that does not compile or does not run loses all correctness points.

Answer 1

Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

public class HelloWorld{

public static void main(String []args){
int[] arr={0,-3,5,-4,-2,3,1,0};
int[] first=new int[arr.length];
first[0]=0;
for(int i=1;i<arr.length;i++)
{
first[i]=first[i-1]+arr[i-1];
}
int[] second=new int[arr.length];
second[arr.length-1]=0;
for(int i=arr.length-2;i>=0;i--)
{
second[i]=second[i+1]+arr[i+1];
}
for(int i=0;i<arr.length;i++)
{
if(first[i]==second[i])
System.out.println("Index: "+i+" is stable");
}
}
}

null

Kindly revert for any queries

Thanks.