Commit 0463574

committed

Sorting algo

1 parent 1f6153e commit 0463574Copy full SHA for 0463574

File tree

+17

-2

lines changed

+17

-2

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+public class LinearSearch {`
	`2`	`+ public static void main(String[] args) {`
	`3`	`+ int[] arr = {76,87,89,95,1,56,34,22};`
	`4`	`+ int target = 34;`
	`5`	`+ linearSearch(arr,target);`
	`6`	`+`
	`7`	`+ }`
	`8`	`+ static void linearSearch(int[] arr, int target){`
	`9`	`+ for (int i = 0; i < arr.length; i++) {`
	`10`	`+ if (arr[i]==target){`
	`11`	`+ System.out.println("Item found at " + i);`
	`12`	`+ }`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+}`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,12 +9,12 @@ public static void main(String[] args) {`
`9`	`9`	`static void sort(int[] arr){`
`10`	`10`	`for (int i = 0; i < arr.length ; i++) {`
`11`	`11`	`int last = arr.length-1-i;`
`12`		`- int largest = getMaxIndex(arr,0,last );`
	`12`	`+ int largest = getMaxIndex(arr,last );`
`13`	`13`	`swap(arr, largest, last);`
`14`	`14`	`}`
`15`	`15`	`}`
`16`	`16`
`17`		`- static int getMaxIndex(int[] arr, int start, intlast){`
	`17`	`+ static int getMaxIndex(int[] arr, int last){`
`18`	`18`	`int largest = 0;`
`19`	`19`	`for (int i = 0; i <= last ; i++) {`
`20`	`20`	`if (arr[largest] < arr[i]){`

Comments

(0)