Merge branch 'master' into master

Author: ronijpandey

InsertionSort.java

@@ -0,0 +1,33 @@
+// Java program for implementation of Insertion Sort
+class InsertionSort{
+    void sort(int arr[]){
+        int n = arr.length;
+        for (int i=1; i<n; ++i){
+            int key = arr[i];
+            int j = i-1;
+ 
+            while (j>=0 && arr[j] > key){
+                arr[j+1] = arr[j];
+                j = j-1;
+            }
+            arr[j+1] = key;
+        }
+    }
+ 
+    static void printArray(int arr[]){
+        int n = arr.length;
+        for (int i=0; i<n; ++i)
+            System.out.print(arr[i] + " ");
+ 
+        System.out.println();
+    }
+ 
+    public static void main(String args[]){        
+        int arr[] = {12, 11, 13, 5, 6};
+ 
+        InsertionSort ob = new InsertionSort();        
+        ob.sort(arr);
+         
+        printArray(arr);
+    }
+}

JavaDateAndTime.java

@@ -20,9 +20,19 @@ public class JavaDateAndTime {
     public static String getDay(String day, String month, String year) {
 
         int y = Integer.parseInt(year);
+        /**
+          * Converts the String type year into integer type y using parseInt() method)
+       */   
+       
         int m = Integer.parseInt(month);
+        /**
+           * Converts the String type month into integer type y using parseInt() method)
+       */   
         int d = Integer.parseInt(day);
 
+          /**
+           * Converts the String type day into integer type y using parseInt() method)
+       */   
         Calendar c = Calendar.getInstance();
         c.set(y, m - 1, d);
 

Palindrome_or_not.java

@@ -3,37 +3,23 @@
 /*
 Write a program to check the given number is palindrome or not?
 Descritpion : A Palindrome number is a number that remains the same when its digits are reversed. Like 16461, for example: we take 121 and reverse it, after revers it is same as original number
- */
+*/
 import java.util.Scanner;
 
-class P {
-
-    public static void main(String args[]) {
-        int n, x, i, number;
-
-        boolean f = true;
-
-        Scanner sc = new Scanner(System.in);
-
-        number = sc.nextInt();
-
-        String str = Integer.toString(number);
-
-        String strArr[] = str.split("");
-
-        x = str.length();
-        n = x / 2;
-        for (i = 0; i < n; i++) {
-            if (strArr[i].compareTo(strArr[--x]) != 0) {
-                f = false;
-                break;
-            }
-        }
-
-        if (f == true) {
-            System.out.print(str + " is palindrome ");
-        } else {
-            System.out.print(str + " is not a palindrome");
-        }
-    }
+class Palindrome_or_not
+{
+  public static void main(Sting args[])
+  {
+    Scanner x = new Scanner(System.in);
+    
+    String st=x.next();
+    String w="";
+    int i;
+    for(i=0;i<st.length();i++)
+      w=st.charAt(i)+w;
+    if(st.compareTo(w)==0)
+      System.out.prinltn("Number is Pallindrome");
+    else
+      System.out.println("Number is Not Pallindrome");
+  }
 }

README.md

@@ -1,2 +1,3 @@
 # Java-Codes
 classroom programs of java.
+Contains many codes for the sole purpose of encouraging open source development

Root.java

@@ -1,8 +1,9 @@
 /* This program is to find value of root node in a tree 
 when value of each node and sum of child nodes of all nodes is given. */
-package javacodes;
 
-import java.util.*;     //import packages
+package javacodes;    //encapsulates a group of classes into a package called javacodes
+
+import java.util.*;     //import package of util class
 
 public class Root {