Added other Sorting Algorithms.

Sorting/BubbleSort.java

@@ -0,0 +1,27 @@
+import java.util.Arrays;
+
+public class BubbleSortImproved {
+    public static void main(String[] args) {
+        int[] arr = {8,7,6,5,4,3,2,1};
+        int[] ans = bubbleSort(arr);
+        System.out.println(Arrays.toString(ans));
+    }
+    static int[] bubbleSort(int[] arr){
+        int flag = 0;
+        int n = arr.length;
+        for(int i = 0;i<n-1;i++){
+            flag=0;
+            for(int j = 1;j<n-i;j++){
+                if(arr[j]<arr[j-1]){
+                        int temp = arr[j];
+                        arr[j]=arr[j-1];
+                        arr[j-1]=temp;
+                        flag = 1;
+                }
+            }
+            if(flag==0) return arr;
+        }
+        return arr;
+    }
+
+}

Sorting/CycleSort.java

@@ -0,0 +1,27 @@
+import java.util.Arrays;
+
+public class CycleSort {
+    public static void main(String[] args) {
+        int[] arr = {5,2,4,1,3};
+        cyclesort(arr);
+        System.out.println(Arrays.toString(arr));
+    }
+
+    static void cyclesort(int[] arr){
+        int i = 0;
+        while(i<arr.length){
+            if(arr[i]==i+1){
+                i++;
+            }else{
+                swap(arr,i,arr[i]-1);
+            }
+        }
+    }
+
+    static void swap(int[] arr,int i,int j){
+        int temp = arr[i];
+        arr[i]=arr[j];
+        arr[j]=temp;
+    }
+
+}

Sorting/InsertionSort.java

@@ -0,0 +1,25 @@
+import java.util.Arrays;
+
+public class InsertionSort {
+    public static void main(String[] args) {
+        int[] arr = {5,4,3,2,1};
+        insertion(arr);
+        System.out.println(Arrays.toString(arr));
+    }
+    static void insertion(int[] arr){
+        for(int i = 0;i<arr.length-1;i++){
+            for(int j = i+1;j>0;j--){
+                if(arr[j-1]>arr[j]){
+                    swap(arr,j-1,j);
+                }
+            }
+        }
+    }
+
+    static void swap(int[] arr,int i, int j){
+        int temp = arr[i];
+        arr[i] = arr[j];
+        arr[j]=temp;
+    }
+
+}

Sorting/QuickSort.java

@@ -0,0 +1,39 @@
+import java.util.Arrays;
+
+public class QuickSort {
+    public static void main(String[] args) {
+        int[] arr = {5,9,1,7,3,4,0,2};
+        quicksort(arr,0,arr.length-1);
+        System.out.println(Arrays.toString(arr));
+    }
+
+    static void quicksort(int[] arr,int lb,int ub){
+        if(lb>=ub) return;
+
+        int start = lb;
+        int end = ub;
+        int mid = lb + (ub-lb)/2;
+        int pivot = arr[mid];
+
+        while(start<=end){
+            while(arr[start]<pivot){
+                start++;
+            }
+            while(arr[end]>pivot){
+                end--;
+            }
+
+            if(start<=end){
+                int temp = arr[start];
+                arr[start]=arr[end];
+                arr[end]=temp;
+                start++;
+                end--;
+            }
+        }
+        quicksort(arr,lb,end);
+        quicksort(arr,start,ub);
+
+    }
+
+}

Sorting/SelectionSort.java

@@ -0,0 +1,36 @@
+import java.util.Arrays;
+
+public class SelectionSort {
+    public static void main(String[] args) {
+        int[] arr = {6,5,4,3,2,1};
+        selectionsort(arr);
+        System.out.println(Arrays.toString(arr));
+    }
+
+
+    static void selectionsort(int[] arr){
+        for(int i = 0;i<arr.length;i++){
+            int lastindex = arr.length-i-1;
+            int maxindex = max(arr,0,lastindex);
+            swap(arr,lastindex,maxindex);
+        }
+    }
+
+    static void swap(int[] arr,int last,int max){
+        int temp = arr[last];
+        arr[last] = arr[max];
+        arr[max] = temp;
+    }
+
+    static int max(int[] arr,int start,int end){
+        int max = start;
+        for(int i = start;i<=end;i++){
+            if(arr[i]>arr[max]){
+                max=i;
+            }
+        }
+        return max;
+    }
+
+
+}