Sorting Algorithm implemented in Java (Phantsure#10)

Author: piyush072

Sorting/bubbleSort/Java/bubble_sort.java

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

Sorting/insertionSort/Java/insertion_sort.java

@@ -0,0 +1,41 @@
+class InsertionSort { 
+ /*Function to sort array using insertion sort*/
+ void sort(int arr[]) 
+ { 
+ int n = arr.length; 
+ for (int i = 1; i < n; ++i) { 
+ int key = arr[i]; 
+ int 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 && arr[j] > key) { 
+ arr[j + 1] = arr[j]; 
+ j = j - 1; 
+ } 
+ arr[j + 1] = key; 
+ } 
+ } 
+ 
+ /* A utility function to print array of size n*/
+ static void printArray(int arr[]) 
+ { 
+ int n = arr.length; 
+ for (int i = 0; i < n; ++i) 
+ System.out.print(arr[i] + " "); 
+ 
+ System.out.println(); 
+ } 
+ 
+ // Driver method 
+ public static void main(String args[]) 
+ { 
+ int arr[] = { 12, 11, 13, 5, 6 }; 
+ 
+ InsertionSort ob = new InsertionSort(); 
+ ob.sort(arr); 
+ 
+ printArray(arr); 
+ } 
+}