some sorting algorithms are added in java language

Author: venkatabhaskar3000

.DS_Store

@@ -0,0 +1,34 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class BubbleSort {  //For Ascending order.
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n;
+        n=sc.nextInt();
+        int[] arr = new int[n];
+        for(int i=0;i<n;i++)
+        {
+            arr[i]=sc.nextInt();
+        }
+        bubblesort(arr);
+        System.out.println(Arrays.toString(arr));
+    }
+
+    public static void bubblesort(int[] arr) {
+        for(int i=0;i<arr.length;i++)
+        {
+            for(int j=1;j<arr.length-i;j++)
+            {
+                if(arr[j-1]>arr[j])
+                {
+                    int temp;  //swapping
+                    temp=arr[j];
+                    arr[j]=arr[j-1];
+                    arr[j-1]=temp;
+                }
+            }
+        }
+    }
+
+}

Algorithms/.DS_Store

@@ -0,0 +1,35 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class CyclicSort { /**cyclic sort varies with the given range of numbers in the
+ array this algorithm is for [0 , N-1] and the size of array is 'N' **/
+public static void main(String[] args) {
+    Scanner sc = new Scanner(System.in);
+    int n,k=0,temp;
+    n= sc.nextInt();
+    int[] arr = new int[n];
+    for(int i=0;i<n;i++)
+    {
+        arr[i]=sc.nextInt();
+    }
+    cyclicsort(arr,n);
+    System.out.println(Arrays.toString(arr));
+}
+
+    public static void cyclicsort(int[] arr, int n) {
+        int k=0,temp=0;
+        while(k<n)
+        {
+            if(arr[k] == k)
+            {
+                k++;
+            }
+            else
+            {
+                temp=arr[k];
+                arr[k]=arr[temp];
+                arr[temp]=temp;
+            }
+        }
+    }
+}

Algorithms/java/.DS_Store

@@ -0,0 +1,38 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class InsertionSort {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n;
+        n= sc.nextInt();
+        int[] arr = new int[n];
+        for(int i=0;i<n;i++)
+        {
+            arr[i]=sc.nextInt();
+        }
+        insertionsort(arr,n);
+        System.out.println(Arrays.toString(arr));
+
+    }
+
+    public static void insertionsort(int[] arr, int n) {
+        for(int i=0;i<n-1;i++)
+        {
+            for(int j=1+i;j>0;j--)
+            {
+                if(arr[j]<arr[j-1])
+                {
+                    int temp; //swapping
+                    temp=arr[j];
+                    arr[j]=arr[j-1];
+                    arr[j-1]=temp;
+                }
+                else
+                {
+                    break;
+                }
+            }
+        }
+    }
+}

Algorithms/java/sorting/BubbleSort.java

@@ -0,0 +1,42 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class SelectionSort {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n,temp1,temp2;
+        n=sc.nextInt();
+        temp1=n;
+        temp2=n;
+        int[] arr = new int[n];
+        for(int i=0;i<n;i++)
+        {
+            arr[i]=sc.nextInt();
+        }
+        for(int i=0;i<n;i++)
+        {
+            swap(arr,findHighInd(arr,--temp1),--temp2);
+        }
+        System.out.println(Arrays.toString(arr));
+    }
+
+    public static int findHighInd(int[] arr, int num) {
+        int temp=arr[0],real=0;
+        for(int i=0;i<=num;i++)
+        {
+            if(temp<arr[i])
+            {
+                temp=arr[i];
+                real=i;
+            }
+        }
+        return real;
+    }
+    public static void swap(int[] arr, int var1,int var2) {
+        int temp;
+        temp=arr[var1];
+        arr[var1]=arr[var2];
+        arr[var2]=temp;
+    }
+
+}