Update sort.java

Author: navjotdadwal

Basic Codes/sort.java

@@ -1,46 +1,41 @@
-// Sir this is merge sort time complexity to sort is O(nlogn)
+/*
+question -
+Take 10 numbers as input from the user and sort it
+*/
 
 import java.util.*;  
 class Main
 {
-    void merge(int arr[], int l, int m, int r)
+    void merge(int a[], int l, int m, int r)     // merging the splited sorted arrays
     {
-        int n1 = m - l + 1;
-        int n2 = r - m;
+        int n1 = m - l + 1, n2 = r - m;
 
         int L[] = new int[n1];
         int R[] = new int[n2];
 
         for (int i = 0; i < n1; ++i)
-            L[i] = arr[l + i];
+            L[i] = a[l + i];
         for (int j = 0; j < n2; ++j)
-            R[j] = arr[m + 1 + j];
+            R[j] = a[m + 1 + j];
 
         int i = 0, j = 0;
         int k = l;
         while (i < n1 && j < n2) {
             if (L[i] <= R[j]) {
-                arr[k] = L[i];
-                i++;
+                a[k++] = L[i++];
             }
             else {
-                arr[k] = R[j];
-                j++;
+                a[k++] = R[j++];
             }
-            k++;
         }
         while (i < n1) {
-            arr[k] = L[i];
-            i++;
-            k++;
+            a[k++] = L[i++];
         }
         while (j < n2) {
-            arr[k] = R[j];
-            j++;
-            k++;
+            a[k++] = R[j++];
         }
     }
-    void sort(int arr[], int l, int r)
+    void sort(int arr[], int l, int r)         // dividing the array then merging sorted arrays
     {
         if (l < r) {
             int m =l+ (r-l)/2;
@@ -49,13 +44,6 @@ void sort(int arr[], int l, int r)
             merge(arr, l, m, r);
         }
     }
-    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[])
     {
         Scanner sc= new Scanner(System.in);
@@ -65,13 +53,13 @@ public static void main(String args[])
         {  
           arr[i]=sc.nextInt();  
         } 
-        System.out.println("Given Array");
-        printArray(arr);
-  
         Main ob = new Main();
         ob.sort(arr, 0, arr.length - 1);
 
         System.out.println("\nSorted array");
-        printArray(arr);
+        int n = arr.length;
+        for (int i = 0; i < n; ++i)
+            System.out.print(arr[i] + " ");
+        System.out.println();
     }
 }