Is Array Sorted?

 Take as input N, the size of array. Take N more inputs and store that in an array. Write a recursive function which returns true if the array is sorted and false otherwise. Print the value returned.

Input Format

Enter a number N and take N more inputs and store in an array

Constraints

None

Output Format

Display the Boolean result

Sample Input

4
1
2
3
4

Sample Output

true

import java.util.Scanner;


public class SortArrayChecker {
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int length=s.nextInt();
int arr[]=new int[length];
for(int i=0; i<arr.length; i++)
{
arr[i]=s.nextInt();
}
boolean status=false;
System.out.println(sortArrayCheck(arr,0,1,status));
// System.out.println(Arrays.toString(arr));
s.close();
}
private static boolean sortArrayCheck(int arr[],int i, int j,boolean status)
{
if(arr.length==1)
{
status=true;
return status;
}
if(i>=arr.length || j>=arr.length)
{
return status;
}
if(arr[i]<=arr[j])
{
status=true;
}
else
{
status=false;
}
return sortArrayCheck(arr, i+1, j+1, status);

//return true;


}

}