FilesExpand file tree

 main

/

CheckSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (27 loc) · 849 Bytes

 main

/

CheckSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (27 loc) · 849 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

//Check if an array is sorted (strictly increasing). -

// time complexity = O(n)

package Recursion;

public class CheckSortedArray {

public static boolean checkSorted(int arr[], int idx){

if(idx == arr.length-1){

return true;

}

/* if(arr[idx] < arr[idx+1]){

// array is sorted till now

return checkSorted(arr,idx+1);

} else{

return false;

} */

// another way

if(arr[idx] >= arr[idx+1]){

// array is unsorted

return false;

}

return checkSorted(arr, idx+1);

}

public static void main(String[] args) {

int arr[] = {1, 0, 3};

System.out.print(" Array is sorted: ");

System.out.print(checkSorted(arr, 0));

}

}