Added more sorting algorithms

data_structures/sortings/BubbleSort.java

@@ -0,0 +1,27 @@
+class BubbleSort { 
+    void bubbleSort(int arr[]) { 
+        int n = arr.length; 
+        for (int i = 0; i < n-1; i++){ 
+            for (int j = 0; j < n-i-1; j++){ 
+                if (arr[j] > arr[j+1]){ 
+                    int temp = arr[j]; 
+                    arr[j] = arr[j+1]; 
+                    arr[j+1] = temp; 
+                }
+            }
+        }
+    }
+    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[]) { 
+        BubbleSort bs = new BubbleSort(); 
+        int arr[] = {1,25,19,81,95,24,65}; 
+        bs.bubbleSort(arr); 
+        System.out.println("Sorted array"); 
+        bs.printArray(arr); 
+    } 
+} 

data_structures/sortings/SelectionSort.java

@@ -0,0 +1,27 @@
+class SelectionSort{ 
+    void sort(int arr[]) { 
+        int n = arr.length; 
+        for (int i = 0; i < n-1; i++) { 
+            int min_index = i; 
+            for (int j = i+1; j < n; j++) 
+                if (arr[j] < arr[min_index]) 
+                    min_index = j; 
+            int temp = arr[min_index]; 
+            arr[min_index] = arr[i]; 
+            arr[i] = temp; 
+        } 
+    } 
+    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[]) { 
+        SelectionSort ss= new SelectionSort(); 
+        int arr[] = {1,25,12,98,14,28}; 
+        ss.sort(arr); 
+        System.out.println("Sorted array"); 
+        ss.printArray(arr); 
+    } 
+}