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/Array/CheckArraySorted.java at main · PrityKumari14/JavaProgramming Expand file tree/ Copy pathCheckArraySorted.javaMore file actions 50 lines (41 loc) · 1.3 KB / Copy pathCheckArraySorted.javaFile metadata and controls50 lines (41 loc) · 1.3 KB 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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 //Take an array of numbers as input and check if // it is an array sorted in ascending order. //Eg : { 1, 2, 4, 7 } is sorted in ascending order. // {3, 4, 6, 2} is not sorted in ascending order. package Array; import java.util.*; public class CheckArraySorted { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int size = sc.nextInt(); int arrays[] = new int[size]; //input for(int i=0; i<size; i++){ arrays[i] = sc.nextInt(); } /* boolean isAscending = true; for(int i=0; i<arrays.length-1; i++){ if(arrays[i]>arrays[i+1]){ isAscending = false; } } if(isAscending){ System.out.println("The array is sorted in ascending order."); }else{ System.out.println("The array is not sorted in ascending order"); } } }*/ boolean isDiscending = true; for(int i=0; i<arrays.length-1; i++){ if(arrays[i]<arrays[i+1]){ isDiscending = false; } } if(isDiscending){ System.out.println("The array is sorted in discending order."); }else{ System.out.println("The array is not sorted in discending order"); } } } |
| You are visitor 01402520 — 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. |