Merge pull request codec-akash#11 from Ashsakshi19/master

codec-akash · web-flow · commit b86aa20d10a4 · 2020-10-01T09:02:28.000+05:30
InsertionSort
diff --git a/ArmstrongNumber b/ArmstrongNumber
@@ -0,0 +1,20 @@
+public class ArmstrongNum {
+
+    public static void main(String[] args) {
+
+        int num = 370, number, temp, total = 0;
+
+        number = num;
+        while (number != 0)
+        {
+            temp = number % 10;
+            total = total + temp*temp*temp;
+            number /= 10;
+        }
+
+        if(total == num)
+            System.out.println(num + " is an Armstrong number");
+        else
+            System.out.println(num + " is not an Armstrong number");
+    }
+}
diff --git a/InsertionSort.java b/InsertionSort.java
@@ -0,0 +1,46 @@
+ 
+import java.util.Scanner;
+ 
+
+public class InsertionSort 
+{
+    public static void sort( int arr[] )
+    {
+        int N = arr.length;
+        int i, j, temp;
+        for (i = 1; i< N; i++) 
+        {
+            j = i;
+            temp = arr[i];    
+            while (j > 0 && temp < arr[j-1])
+            {
+                arr[j] = arr[j-1];
+                j = j-1;
+            }
+            arr[j] = temp;            
+        }        
+    }    
+   
+    public static void main(String[] args) 
+    {
+        Scanner scan = new Scanner( System.in );        
+        System.out.println("Insertion Sort Test\n");
+        int n, i;
+       
+        System.out.println("Enter number of integer elements");
+        n = scan.nextInt();
+       
+        int arr[] = new int[ n ];
+    
+        System.out.println("\nEnter "+ n +" integer elements");
+        for (i = 0; i < n; i++)
+            arr[i] = scan.nextInt();
+     
+        sort(arr);
+        
+        System.out.println("\nElements after sorting ");        
+        for (i = 0; i < n; i++)
+            System.out.print(arr[i]+" ");            
+        System.out.println();                     
+    }    
+}
