Merge pull request #486 from akshat-2502/SelectSort

Select sort

Author: geekquad

java/sorting/bubble_sort.java

@@ -0,0 +1,40 @@
+import java.io.*;
+class BubSort
+{
+static void bubbleSort(int arr[], int n)
+{
+int i, j, temp;
+boolean swapped;
+for (i = 0; i < n - 1; i++)
+{
+swapped = false;
+for (j = 0; j < n - i - 1; j++)
+{
+if (arr[j] > arr[j + 1])
+{
+temp = arr[j];
+arr[j] = arr[j + 1];
+arr[j + 1] = temp;
+swapped = true;
+}
+}
+if (swapped == false)
+break;
+}
+}
+static void printArray(int arr[], int size)
+{
+int i;
+for (i = 0; i < size; i++)
+System.out.print(arr[i] + " ");
+System.out.println();
+}
+public static void main(String args[])
+{
+int arr[] = { 64, 34, 25, 12, 22, 11, 90 };
+int n = arr.length;
+bubbleSort(arr, n);
+System.out.println("Sorted array: ");
+printArray(arr, n);
+}
+}

java/sorting/selection_sort.java

@@ -0,0 +1,32 @@
+class SelectionSort
+{
+void sort(int arr[])
+{
+int n = arr.length;
+for (int i = 0; i < n-1; i++)
+{
+int min_idx = i;
+for (int j = i+1; j < n; j++)
+if (arr[j] < arr[min_idx])
+min_idx = j;
+int temp = arr[min_idx];
+arr[min_idx] = 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 ob = new SelectionSort();
+int arr[] = {64,25,12,22,11};
+ob.sort(arr);
+System.out.println("Sorted array");
+ob.printArray(arr);
+}
+}