GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaProgramming/Recursion/CheckSortedArray.java at main · karterhhgg/JavaProgramming Expand file tree/ Copy pathCheckSortedArray.javaMore file actions 32 lines (27 loc) · 849 Bytes / Copy pathCheckSortedArray.javaFile metadata and controls32 lines (27 loc) · 849 Bytes 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)); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |