Commit e737dc5

committed

FEAT Implemented brute force search

1 parent ec24ad9 commit e737dc5Copy full SHA for e737dc5

File tree

+16

-0

lines changed

+16

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -164,6 +164,19 @@ private static int rank(int key, int[] array, int minIndex, int maxIndex) {`
`164`	`164`	`return rank(key, array, minIndex, maxIndex - 1);`
`165`	`165`	`}`
`166`	`166`
	`167`	`+ /**`
	`168`	`+ * static method to brute force search for a "key" in an int array`
	`169`	`+ * */`
	`170`	`+ public static int bruteForceSearch(int key, int[] theArray) {`
	`171`	`+ for (int i = 0; i < theArray.length; i++) {`
	`172`	`+ if (theArray[i] == key) {`
	`173`	`+ return i;`
	`174`	`+ }`
	`175`	`+ }`
	`176`	`+`
	`177`	`+ return -1;`
	`178`	`+ }`
	`179`	`+`
`167`	`180`
`168`	`181`	`public static void main(String[] args) {`
`169`	`182`	`Random generator = new Random();`
`@@ -247,5 +260,8 @@ public static void main(String[] args) {`
`247`	`260`	`System.out.println("index: " + binarySearch(5, testIntArray));`
`248`	`261`	`System.out.println();`
`249`	`262`
	`263`	`+ System.out.println("- Brute Force Search: key = 3");`
	`264`	`+ System.out.println("index: " + bruteForceSearch(3, testIntArray));`
	`265`	`+ System.out.println();`
`250`	`266`	`}`
`251`	`267`	`}`

Comments

(0)