Merge pull request darpanjbora#3 from ADVAITH18/master

darpanjbora · web-flow · commit 59b9c094f070 · 2019-10-13T10:53:40.000+05:30
Sorting Algorithms
diff --git a/Sorting Algorithms/bubble_sort.java b/Sorting Algorithms/bubble_sort.java
@@ -0,0 +1,30 @@
+import java.io.*;
+class Bubble
+{
+    public static void main()throws IOException
+    {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int i,j,t,n;
+        System.out.println("Enter the size of the array");
+        n=Integer.parseInt(br.readLine());
+        int a[]=new int[n];
+        System.out.println("Enter the array elements");
+        for(i=0;i<n;i++)
+            a[i]=Integer.parseInt(br.readLine());
+        System.out.println("ORIGINAL ARRAY");
+        for(i=0;i<n;i++)
+           System.out.print(a[i]+"  ");
+        System.out.println();
+        for(i=0;i<n;i++)
+           for(j=0;j<n-1;j++)
+                if(a[j]>a[j+1])
+                {
+                    t=a[j];
+                    a[j]=a[j+1];
+                    a[j+1]=t;
+                }
+        System.out.println("SORTED ARRAY");
+        for(i=0;i<n;i++)
+            System.out.print(a[i]+"  ");
+        }
+    }
diff --git a/Sorting Algorithms/insertion_sort.java b/Sorting Algorithms/insertion_sort.java
@@ -0,0 +1,39 @@
+import java.io.*;
+class Insertion
+{
+  public static void main()throws IOException
+  {
+    BufferedReader br=new BufferedReader (new InputStreamReader(System.in));
+    int n,l,key,i,j;
+    System.out.println("Enter the size of the array");
+    n=Integer.parseInt(br.readLine());
+    int a[]=new int[n];
+    System.out.println("Enter the array elements");
+    for(i=0;i<n;i++)
+        a[i]=Integer.parseInt(br.readLine());
+    System.out.println("ORGINAL ARRAY : ");
+    for(i=0;i<n;i++)
+        System.out.println(a[i]);
+        
+    //Sorting algorithm
+    for(i=1;i<n;i++)
+    {
+       key = a[i]; 
+       j = i - 1; 
+        /* Move elements of arr[0..i-1], that are 
+           greater than key, to one position ahead 
+               of their current position */
+        while (j >= 0 && a[j] > key)
+        { 
+          a[j + 1] = a[j]; 
+          j = j - 1; 
+         } 
+         a[j+1]=key;
+         
+      }
+      //Displaying the array
+      System.out.println("SORTED ARRAY : ");
+      for(i=0;i<n;i++)
+        System.out.println(a[i]);
+   }
+}
diff --git a/Sorting Algorithms/selection_sort.java b/Sorting Algorithms/selection_sort.java
@@ -0,0 +1,30 @@
+import java.io.*;
+class Selection
+{
+    public static void main()throws IOException
+    {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int i,j,t,n;
+        System.out.println("Enter the size of the array");
+        n=Integer.parseInt(br.readLine());
+        int a[]=new int[n];
+        System.out.println("Enter the array elements");
+        for(i=0;i<n;i++)
+            a[i]=Integer.parseInt(br.readLine());
+        System.out.println("ORIGINAL ARRAY");
+        for(i=0;i<n;i++)
+           System.out.print(a[i]+"  ");
+        System.out.println();
+        for(i=0;i<n;i++)
+           for(j=i+1;j<n;j++)
+                if(a[i]>a[j])
+                {
+                    t=a[i];
+                    a[i]=a[j];
+                    a[j]=t;
+                }
+        System.out.println("SORTED ARRAY");
+        for(i=0;i<n;i++)
+            System.out.print(a[i]+"  ");
+        }
+    }
