Commit 1f6153e

committed

Sorting algo

1 parent f05064d commit 1f6153eCopy full SHA for 1f6153e

File tree

+74

-0

lines changed

+74

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+import java.util.Arrays;`
	`2`	`+`
	`3`	`+public class BubbleSort {`
	`4`	`+ public static void main(String[] args) {`
	`5`	`+ int[] arr = {10,5,87,43,56,99,10,12,139,12,33,66,-4,-76,-45,-23-17,0};`
	`6`	`+ bubbleSort(arr);`
	`7`	`+ System.out.println(Arrays.toString(arr));`
	`8`	`+ }`
	`9`	`+ static void bubbleSort(int[] arr){`
	`10`	`+ int temp;`
	`11`	`+ for (int i = 0; i < arr.length; i++) {`
	`12`	`+ for (int j = 1; j < arr.length - i; j++) {`
	`13`	`+ if (arr[j] < arr[j-1]){`
	`14`	`+ temp = arr[j];`
	`15`	`+ arr[j]= arr[j-1];`
	`16`	`+ arr[j-1] = temp;`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+}`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+import java.util.Arrays;`
	`2`	`+`
	`3`	`+public class InsertionSort {`
	`4`	`+ public static void main(String[] args) {`
	`5`	`+ int[] arr = {-10,-20,-3,-40,-5,65,87,99,54,33,21,8,12};`
	`6`	`+ insertionSort(arr);`
	`7`	`+ System.out.println(Arrays.toString(arr));`
	`8`	`+ }`
	`9`	`+`
	`10`	`+ static void insertionSort(int[] arr){`
	`11`	`+ for (int i = 0; i < arr.length-1 ; i++) {`
	`12`	`+ for (int j = i+1; j > 0; j--) {`
	`13`	`+ if (arr[j-1]> arr[j]){`
	`14`	`+ int temp = arr[j-1];`
	`15`	`+ arr[j-1]=arr[j];`
	`16`	`+ arr[j]=temp;`
	`17`	`+ }else break;`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+}`

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+import java.util.Arrays;`
	`2`	`+`
	`3`	`+public class SelectionSort {`
	`4`	`+ public static void main(String[] args) {`
	`5`	`+ int[] arr = {-10,-20,-3,-40,-5,65,87,99,54,33,21,8,12};`
	`6`	`+ sort(arr);`
	`7`	`+ System.out.println(Arrays.toString(arr));`
	`8`	`+ }`
	`9`	`+ static void sort(int[] arr){`
	`10`	`+ for (int i = 0; i < arr.length ; i++) {`
	`11`	`+ int last = arr.length-1-i;`
	`12`	`+ int largest = getMaxIndex(arr,0,last );`
	`13`	`+ swap(arr, largest, last);`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ static int getMaxIndex(int[] arr, int start, int last){`
	`18`	`+ int largest = 0;`
	`19`	`+ for (int i = 0; i <= last ; i++) {`
	`20`	`+ if (arr[largest] < arr[i]){`
	`21`	`+ largest=i;`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+ return largest;`
	`25`	`+ }`
	`26`	`+`
	`27`	`+ static void swap(int[] arr, int largest, int last){`
	`28`	`+ int temp = arr[last];`
	`29`	`+ arr[last] = arr[largest];`
	`30`	`+ arr[largest]=temp;`
	`31`	`+ }`
	`32`	`+}`

Comments

(0)