Create Siddhartha_sorting

src/pkg1/Siddhartha_sorting

@@ -0,0 +1,48 @@
+
+
+
+import java.util.Arrays;
+
+public class Siddhartha_sorting {
+    public static void main(String args[]){
+        int arr[]={10,55,8,6,7,3};
+        arr= mergeSort(arr);
+        System.out.println(Arrays.toString(arr));
+    }
+    static int[] mergeSort(int [] arr){
+        if(arr.length == 1){
+            return arr;
+        }
+        int mid =arr.length/2;
+
+        int[] left = mergeSort(Arrays.copyOfRange(arr, 0, mid));
+        int[] right = mergeSort(Arrays.copyOfRange(arr, mid, arr.length));
+        return merge (left,right);
+    }
+    public static int[] merge(int [] first,int[] second){
+        int [] mix =new int [first.length+second.length];
+        int i=0;
+        int j=0;
+        int k=0;
+        while(i<first.length && j<second.length){
+            if (first[i]<second[j]){
+                mix[k]=first[i];
+                i++;
+            }else{
+                mix[k]=second[j];
+                j++;
+            }
+            k++;
+
+        } //to add the rest elements left either on i's side or j's side;
+        while(i<first.length){
+            mix[k]=first[i];
+            i++;
+            k++;}
+        while(j<second.length){
+            mix[k]=second[j];
+            j++;
+            k++;}
+
+        return mix;}
+}