first commit

Author: PrityKumari14

.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+    "java.debug.settings.onBuildFailureProceed": true
+}

AirthmeticOperator.class

@@ -0,0 +1,18 @@
+// Source code is decompiled from a .class file using FernFlower decompiler.
+public class AirthmeticOperator {
+   public static void main(String[] var0) {
+      byte var1 = 20;
+      byte var2 = 10;
+      int var3 = var1 + var2;
+      int var4 = var1 - var2;
+      int var5 = var1 * var2;
+      int var6 = var1 / var2;
+      int var7 = var1 % var2;
+      System.out.println(var3);
+      System.out.println(var4);
+      System.out.println(var5);
+      System.out.println(var6);
+      System.out.println(var7);
+      System.out.println(var5 / var4);
+   }
+}

AirthmeticOperator.java

@@ -0,0 +1,15 @@
+//Print all even numbers till n.
+import java.util.*;
+public class AllEven {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter the value of n: ");
+        int n = sc.nextInt();
+    
+        for(int i=1; i<=n; i++){
+            if(i%2 == 0){
+            System.out.println(i +":- Even Number");
+            }
+        }
+    }
+}

AllEven.java

@@ -0,0 +1,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");
+        }
+
+    }
+    
+}

Array/CheckArraySorted.java

@@ -0,0 +1,21 @@
+package Array;
+
+public class CreateArray {
+    public static void main(String[] args) {
+        // creating array method - 1 with new keyword
+   /*  int [] marks = new int[3];
+    marks[0] = 80;
+    marks[1] = 70;
+    marks[2] = 90;  */
+
+    // creating array method - 2 
+    int marks[]={70,80,90};
+   //System.out.println(marks[0]);
+   //System.out.println(marks[1]);
+   //System.out.println(marks[2]);
+   for(int i = 0; i<3; i++){
+    System.out.println(marks[i]);
+   }
+}
+    
+}

Array/CreateArray.java

@@ -0,0 +1,28 @@
+// Take an array as imput from the user. Search for a given number x
+// and print the index at which it occurs.
+
+package Array;
+import java.util.*;
+public class LinearSearch {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("size of the array: ");
+        int size = sc.nextInt();
+        System.out.println(" input the array element: ");
+        int numbers[] = new int[size];
+        //for input
+        for(int i=0; i<size; i++){
+            numbers[i]=sc.nextInt();
+        }
+        //for searching
+        System.out.print(" enter the number do you want to search: ");
+        int x = sc.nextInt();
+        for(int i=0; i<size; i++){
+            if(numbers[i] == x){
+            System.out.println(" x found at index: "+i);
+            } 
+        }
+    }
+}
+    
+

Array/LinearSearch.java

@@ -0,0 +1,32 @@
+//Find the maximum & minimum number in an array of integers.
+package Array;
+import java.util.*;
+public class MaximumMinimumNumber {
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int size = sc.nextInt();
+        int numbers[] = new int[size];
+
+        //input
+        for(int i=0; i<size; i++){
+            numbers[i] = sc.nextInt();
+        }
+
+        int max = Integer.MIN_VALUE;
+        int min = Integer.MAX_VALUE;
+
+        for(int i=0; i<numbers.length; i++){
+            if(numbers[i] < min){
+                min = numbers[i];
+            }
+
+            if(numbers[i] > max){
+                max = numbers[i];
+            }
+        }
+
+        System.out.println("Largest number is : "+ max);
+        System.out.println("Smallest number is :"+ min);
+    }
+}

Array/MaximumMinimumNumber.java

@@ -0,0 +1,21 @@
+
+//Taking an array as an input and printing its elements.
+
+package Array;
+import java.util.*;
+public class NormalArray {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int size = sc.nextInt();
+        int numbers[] = new int[size];
+        //for input
+        for(int i=0; i<size; i++){
+            numbers[i]=sc.nextInt();
+        }
+        //for output
+        for(int i=0; i<size; i++){
+            System.out.print(" "+numbers[i]);
+            //System.out.println(numbers[i]);
+        }
+    }
+}

Array/NormalArray.java

@@ -0,0 +1,37 @@
+//Taking a matrix as an input and printing its elements.
+package Array;
+import java.util.*;
+public class Print2DArray {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int rows = sc.nextInt();
+        int cols = sc.nextInt();
+
+        int array[][] = new int[rows][cols];
+
+        //input
+
+        for(int i=0; i<rows; i++){
+            for(int j=0; j<cols; j++){
+                array[i][j] = sc.nextInt();
+            }
+        }
+
+        //output
+        for(int i=0; i<rows; i++){
+            for(int j=0; j<cols; j++){
+                System.out.print(array[i][j]+ "   ");
+            }
+            System.out.println();
+        }
+    }
+    
+}
+//output
+/*
+3
+3
+1 2 3  4 5 6 7 8 9
+1   2   3   
+4   5   6
+7   8   9        */