Add new Algo

Author: Asutosh989

Diff for: 01.Introduction/ColdNumber.java

@@ -0,0 +1,21 @@
+import java.util.*;
+
+class ColdNumber{
+    public static void main(String args[]){
+        Scanner s = new Scanner(System.in);
+        int t=1;
+        int a = s.nextInt();
+        if (a%2==0){
+            t = (int)(a/2);
+        }
+        if (a%2!=0){
+            t = (int)(a/2)+1;
+        }
+        if (a%t==0){
+            System.out.println("Cold Number");
+        }
+        else{
+            System.out.println("Not Cold Number");
+        }
+    }
+}

Diff for: 01.Introduction/HcfLcm.java

@@ -0,0 +1,23 @@
+import java.util.*;
+
+class HcfLcm {
+    public static void main(String args[]){
+        int a = Integer.parseInt(args[0]);
+        int b = Integer.parseInt(args[1]);
+        int h = hcf(a,b);
+        System.out.println(h);
+        System.out.println((a*b)/h);
+    }
+
+    public static int hcf(int a, int b) {
+        while (a!=b) {
+            if (a>b){
+                a = a-b;
+            }
+            else{
+                b = b-a;
+            }
+        }
+        return a;
+    }
+}

Diff for: 01.Introduction/IdAndShip.java

@@ -0,0 +1,28 @@
+import java.util.*;
+
+class IdAndShip {
+    public static void main(String args[]) {
+        Scanner s = new Scanner(System.in);
+        int t = s.nextInt();
+        int i;
+        char a;
+        for (i=1; i<=t; i++){
+            a = s.next().charAt(0);
+            switch(a){
+                case 'B':
+                case 'b': System.out.println("Battleship");break;
+
+                case 'C':
+                case 'c': System.out.println("Cruiser"); break;
+
+                case 'D':
+                case 'd': System.out.println("Destroyer"); break;
+
+                case 'F':
+                case 'f': System.out.println("Frigate"); break;
+
+                default: System.out.println("Enter Valid Choice");
+            }
+        }
+    }
+}

Diff for: 01.Introduction/SineCosine.java

@@ -0,0 +1,12 @@
+import java.util.*;
+
+class SineCosine {
+    public static void main(String args[]){
+        Scanner s = new Scanner(System.in);
+        int n = s.nextInt();
+        int i;
+        for (i=1; i<=n;i++){
+            
+        }
+    }
+}

Diff for: Sorting algorithms/Insertion.java

@@ -0,0 +1,32 @@
+import java.util.*;
+
+class Insertion {
+    public static void main (String args[]) {
+        Scanner s = new Scanner (System.in);
+        System.out.println("Enter number of elements");
+        int n = s.nextInt();
+        int i;
+        int a[] = new int[n];
+        for (i=0;i<n;i++) {
+            a[i] = s.nextInt();
+        }
+        insertion_sort(a,n);
+    }
+
+    public static void insertion_sort(int[] a, int n){
+        int i,j,k;
+        for (j=1;j<n;j++) {
+            k = a[j];
+            i=j-1;
+            while (i>-1 && a[i]>k) {
+                a[i+1] = a[i];
+                i--;
+            }
+            a[i+1] = k;
+        }
+        System.out.println("Sorted array");
+        for (i=0;i<n;i++) {
+            System.out.println(a[i]);
+        }
+    }
+}