added insertion sort , selection sort , bubble sort and shell sort so…

data_structures/sortings/DAA_SelectionSort.java

@@ -0,0 +1,34 @@
+import java.util.*;
+
+public class DAA_SelectionSort {
+    public static void main(String[] args){
+        Scanner input = new Scanner(System.in);
+        System.out.println("Enter number of values");
+        int n = input.nextInt();
+        int[] arr = new int[n];
+        System.out.println("Enter values:");
+        for(int i=0;i<n;i++){
+            arr[i] = input.nextInt();
+        }
+        SelectionSort(arr);
+        System.out.println("Sorted array using selection sort : ");
+        for(int i=0;i<n;i++){
+            System.out.print(arr[i]+" ");
+        }
+    }
+    public static void SelectionSort(int[] arr){
+        int n = arr.length;
+        int minIndex;
+        for(int i=0;i<n-1;i++){
+            minIndex = i;
+            for(int j=i+1;j<n;j++){
+                if(arr[j] < arr[minIndex]){
+                    minIndex = j;
+                }
+            }
+            int temp = arr[i];
+            arr[i] = arr[minIndex];
+            arr[minIndex] = temp;
+        }
+    }
+}

data_structures/sortings/DAA_bubbleSort.java

@@ -0,0 +1,54 @@
+import java.util.Scanner;
+
+public class DAA_bubbleSort {
+    public static void main(String[] args){
+        Scanner input = new Scanner(System.in);
+        System.out.println("Enter no. of values:");
+        int n = input.nextInt();
+        int[] arr = new int[n];
+        System.out.println("Enter values:");
+        for(int i=0;i<n;i++){
+            arr[i] = input.nextInt();
+        }
+        System.out.println("Press 1 for iterative bubble sort 2 for recursive bubble sort:");
+        int choice = input.nextInt();
+        if(choice==1)
+            BubbleSort(arr);
+        else
+            BubbleSortRecursive(arr,n);
+        System.out.println("Array after sorting:");
+        for(int i=0;i<n;i++){
+            System.out.print(arr[i]+" ");
+        }
+    }
+
+    //iterative solution
+    static void BubbleSort(int[] arr){
+        int len=arr.length;
+        for(int i=0;i<len-1;i++){
+            for(int j=0;j<len-i-1;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp= arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1] = temp;
+                }
+            }
+        }
+    }
+
+    //recursive solution
+    static void BubbleSortRecursive(int[] arr,int n){
+        if(n-1>0){
+            for(int j=0;j<n-1;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+            BubbleSortRecursive(arr,n-1);
+        }
+
+    }
+
+}

data_structures/sortings/DAA_insertionSort.java

@@ -0,0 +1,31 @@
+import java.util.*;
+
+public class DAA_insertionSort {
+    public static void main(String[] args){
+        Scanner input = new Scanner(System.in);
+        System.out.println("Enter number of values");
+        int n = input.nextInt();
+        int[] arr = new int[n];
+        System.out.println("Enter values:");
+        for(int i=0;i<n;i++){
+            arr[i] = input.nextInt();
+        }
+        InsertionSort(arr);
+        System.out.println("Sorted array using insertion sort : ");
+        for(int i=0;i<n;i++){
+            System.out.print(arr[i]+" ");
+        }
+    }
+    public static void InsertionSort(int[] arr){
+        int n = arr.length;
+        for(int i=1;i<n;i++){
+            int j=i-1;
+            int temp=arr[i];
+            while(j>=0 && arr[j]>temp) {
+                arr[j + 1] = arr[j];
+                j--;
+            }
+            arr[j+1] = temp;
+        }
+    }
+}

data_structures/sortings/DAA_shellSort.java

@@ -0,0 +1,35 @@
+import java.util.Scanner;
+
+public class DAA_shellSort {
+    public static void main(String[] args){
+        Scanner input = new Scanner(System.in);
+        System.out.println("Enter no. of values:");
+        int n = input.nextInt();
+        int[] arr = new int[n];
+        System.out.println("Enter values:");
+        for(int i=0;i<n;i++){
+            arr[i] = input.nextInt();
+        }
+        ShellSort(arr);
+        System.out.println("Array after sorting:");
+        for(int i=0;i<n;i++){
+            System.out.print(arr[i]+" ");
+        }
+    }
+    static void ShellSort(int[] arr){
+        int n = arr.length;
+        int gap = n/2;
+        while(gap>0){
+            for(int i=gap;i<n;i+=gap){
+                int j=i-gap;
+                int temp = arr[i];
+                while(j>=0 && arr[j]>temp){
+                    arr[j+gap] = arr[j];
+                    j-=gap;
+                }
+                arr[j+gap]=temp;
+            }
+            gap/=2;
+        }
+    }
+}