Initial commit

Ahmfaraz · Ahmfaraz · commit 4c9341abf323 · 2020-05-31T13:04:45.000+05:30
diff --git a/Array.java b/Array.java
@@ -0,0 +1,35 @@
+
+import java.util.*;
+
+public class Array {
+
+  public static void main(String[] args) {
+   Scanner in =new Scanner(System.in);
+   System.out.println("Enter the size of array");
+   int n = in.nextInt();
+   int[] arr = new int[n];
+   int temp=0;
+   int flag=0;
+   System.out.println("Enter the value of array");
+   for(int i=0;i<arr.length;i++){
+     arr[i]=in.nextInt();
+   }
+   System.out.println("Enter the no to search");
+   int srch = in.nextInt();
+   for(int i =0;i<arr.length;i++){
+     if(srch==arr[i]){
+       temp=i;
+       flag++;
+       break;
+       
+     }
+   }
+   if(flag>0){
+     System.out.println(temp);
+   }
+   else{
+     System.out.println("Not found");
+   }
+   
+  }
+}
diff --git a/Bubble.java b/Bubble.java
@@ -0,0 +1,47 @@
+
+import java.util.*;
+class Bsort{
+  void Bubble(int[] n){
+    for(int i=0;i<n.length-1;i++){
+      for(int j=0;j<n.length-1-i;j++){
+        if(n[j]>n[j+1]){
+          int temp = n[j];
+          n[j]= n[j+1];
+          n[j+1]=temp;
+       
+      }
+    }
+    for(int i=0;i<n.length;i++){
+      System.out.println(n[i]);
+    }
+  }
+}
+
+public class array {
+
+  public static void main(String[] args) {
+       Scanner in = new Scanner(System.in);
+       
+        System.out.println("Enter the arry size");
+        
+        int n = in.nextInt();
+        
+        int[] arr = new int[n];
+        
+        System.out.println("Enter the array value");
+        
+        for(int i=0;i<arr.length;i++){
+        
+          arr[i]=in.nextInt();
+          
+        }
+        
+        Bsort obj =new Bsort();
+        
+        
+        obj.Bubble(arr);
+        
+        
+  }
+
+}
diff --git a/Selectiin.java b/Selectiin.java
@@ -0,0 +1,51 @@
+
+import java.util.*;
+
+class Selection{
+  void Ssort(int[] ar){
+    for(int i=0;i<ar.length-1;i++){
+      int min = i;
+      for(int j=i+1;j<ar.length;j++){
+        if(ar[j]<ar[min]){
+          min = j;
+        }
+      }
+      int temp = ar[min];
+      ar[min] = ar[i];
+      ar[i] = temp;
+    }
+    for(int i=0;i<ar.length;i++){
+      System.out.println(ar[i]);
+    }
+  }
+}
+
+public class array {
+
+  public static void main(String[] args) {
+  
+   Scanner nt = new Scanner(System.in);
+   
+    System.out.println("Enter the arry size"); 
+        int n = nt.nextInt();
+        
+        int[] arr = new int[n];
+        
+        System.out.println("Enter the array value");
+        
+        for(int i=0;i<arr.length;i++){
+        
+          arr[i]=nt.nextInt();
+          
+        }
+        
+        Selection obj =new Selection();
+        
+        
+        obj.Ssort(arr);
+        
+  
+
+  }
+
+}
diff --git a/binarySearch.java b/binarySearch.java
@@ -0,0 +1,35 @@
+package array;
+import java.util.*;
+class Binary{
+  int binSearch(int[] a,int low,int high,int num){
+    int mid =(low+high)/2;
+    if(num==a[mid]){
+      return mid;
+      }
+    else if(num>a[mid]){
+    mid =mid+1;
+      return binSearch(a,mid,high,num);
+    }else{
+      mid=mid-1;
+      return binSearch(a,low,mid,num);
+    }
+  }
+}
+
+public class frequency {
+
+  public static void main(String[] args) {
+       Scanner in = new Scanner(System.in);
+       System.out.println("Enter the size of array");
+       int n = in.nextInt();
+       int[] arr = new int[n];
+       for(int i=0;i<arr.length;i++){
+         arr[i]=in.nextInt();
+       }
+       System.out.println("Enter the number to srch");
+       int num =in.nextInt();
+       Binary obj = new Binary();
+       System.out.println(obj.binSearch(arr,0,n,num));
+  }
+
+}
diff --git a/frequency.java b/frequency.java
@@ -0,0 +1,35 @@
+
+import java.util.*;
+class Binary{
+  int binSearch(int[] a,int low,int high,int num){
+    int mid =(low+high)/2;
+    if(num==a[mid]){
+      return mid;
+      }
+    else if(num>a[mid]){
+    mid =mid+1;
+      return binSearch(a,mid,high,num);
+    }else{
+      mid=mid-1;
+      return binSearch(a,low,mid,num);
+    }
+  }
+}
+
+public class frequency {
+
+  public static void main(String[] args) {
+       Scanner in = new Scanner(System.in);
+       System.out.println("Enter the size of array");
+       int n = in.nextInt();
+       int[] arr = new int[n];
+       for(int i=0;i<arr.length;i++){
+         arr[i]=in.nextInt();
+       }
+       System.out.println("Enter the number to srch");
+       int num =in.nextInt();
+       Binary obj = new Binary();
+       System.out.println(obj.binSearch(arr,0,n,num));
+  }
+
+}
diff --git a/month.java b/month.java
@@ -0,0 +1,23 @@
+import java.util.*;
+
+ // Compiler version JDK 11.0.2
+
+ class Dcoder
+ {
+   public static void main(String args[])
+   { 
+    Scanner in = new Scanner(System.in);
+    System.out.println("enter month in small latter");
+    String month = in.nextLine();
+    String[] m1 = {"january","february","march","april","may","june","july","august","september","october","november","december"};
+    int[] days ={31,29,31,30,31,30,31,31,30,31,30,31 };
+   
+    for(int i=0;i<m1.length;i++){
+      if(month.equals(m1[i])){
+        System.out.println(days[i]);
+      }
+    }
+    
+    
+   }
+ }
diff --git a/reversearray.java b/reversearray.java
@@ -0,0 +1,20 @@
+import java.util.*;
+
+ // Compiler version JDK 11.0.2
+
+ class Dcoder
+ {
+   public static void main(String args[])
+   { 
+    Scanner in = new Scanner(System.in);
+    System.out.println("Enetr the size of array");
+    int n = in.nextInt();
+    int[] num = new int[n];
+    for(int i=0;i<num.length;i++){
+      num[i] = in.nextInt();
+    }
+    for(int i =0;i<num.length;i++){
+      System.out.println(num[n-1-i]);
+    }
+   }
+ }
diff --git a/sum and average.java b/sum and average.java
@@ -0,0 +1,26 @@
+import java.util.*;
+
+ // Compiler version JDK 11.0.2
+
+ class Dcoder
+ {
+   public static void main(String args[])
+   { 
+     Scanner in = new Scanner(System.in);
+    System.out.println("enter the size of array");
+    int n = in.nextInt();
+    int[] arr = new int[n];
+    int sum =0;
+    System.out.println("enter the value of array");
+    for(int i =0;i<arr.length;i++){
+      arr[i]=in.nextInt();
+    }
+    for(int i =0;i<arr.length;i++){
+      sum = sum + arr[i];
+    }
+    System.out.println("total="+sum);
+    System.out.println("average="+sum/arr.length);
+    
+    
+   }
+ }
