BAEL-1374 - same search in each loop.

ericgoebelbecker · ericgoebelbecker · commit 6809155a9195 · 2017-12-15T13:19:43.000-05:00
diff --git a/core-java/src/main/java/com/baeldung/array/SearchArrayTest.java b/core-java/src/main/java/com/baeldung/array/SearchArrayTest.java
@@ -26,7 +26,7 @@ public void searchArrayAllocNewList() {
         int count = 1000;
         String[] strings = seedArray(count);
         for (int i = 0; i < count; i++) {
-            searchList(strings, "W");
+            searchList(strings, "T");
         }
 
     }
@@ -37,7 +37,7 @@ public void searchArrayAllocNewSet() {
         int count = 1000;
         String[] strings = seedArray(count);
         for (int i = 0; i < count; i++) {
-            searchSet(strings, "S");
+            searchSet(strings, "T");
         }
     }
 
@@ -51,7 +51,7 @@ public void searchArrayReuseList() {
         List<String> asList = Arrays.asList(strings);
 
         for (int i = 0; i < count; i++) {
-            asList.contains("W");
+            asList.contains("T");
         }
     }
 
@@ -63,7 +63,7 @@ public void searchArrayReuseSet() {
         String[] strings = seedArray(count);
         Set<String> asSet = new HashSet<>(Arrays.asList(strings));
         for (int i = 0; i < count; i++) {
-            asSet.contains("S");
+            asSet.contains("T");
         }
     }
 
@@ -77,7 +77,7 @@ public void searchArrayBinarySearch() {
 
         long startTime = System.nanoTime();
         for (int i = 0; i < count; i++) {
-            Arrays.binarySearch(strings, "A");
+            Arrays.binarySearch(strings, "T");
         }
         long duration = System.nanoTime() - startTime;
         //System.out.println("Binary search:  " + duration / 10000);

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@ public void searchArrayAllocNewList() {`
`26`	`26`	`int count = 1000;`
`27`	`27`	`String[] strings = seedArray(count);`
`28`	`28`	`for (int i = 0; i < count; i++) {`
`29`		`- searchList(strings, "W");`
	`29`	`+ searchList(strings, "T");`
`30`	`30`	`}`
`31`	`31`
`32`	`32`	`}`
`@@ -37,7 +37,7 @@ public void searchArrayAllocNewSet() {`
`37`	`37`	`int count = 1000;`
`38`	`38`	`String[] strings = seedArray(count);`
`39`	`39`	`for (int i = 0; i < count; i++) {`
`40`		`- searchSet(strings, "S");`
	`40`	`+ searchSet(strings, "T");`
`41`	`41`	`}`
`42`	`42`	`}`
`43`	`43`
`@@ -51,7 +51,7 @@ public void searchArrayReuseList() {`
`51`	`51`	`List<String> asList = Arrays.asList(strings);`
`52`	`52`
`53`	`53`	`for (int i = 0; i < count; i++) {`
`54`		`- asList.contains("W");`
	`54`	`+ asList.contains("T");`
`55`	`55`	`}`
`56`	`56`	`}`
`57`	`57`
`@@ -63,7 +63,7 @@ public void searchArrayReuseSet() {`
`63`	`63`	`String[] strings = seedArray(count);`
`64`	`64`	`Set<String> asSet = new HashSet<>(Arrays.asList(strings));`
`65`	`65`	`for (int i = 0; i < count; i++) {`
`66`		`- asSet.contains("S");`
	`66`	`+ asSet.contains("T");`
`67`	`67`	`}`
`68`	`68`	`}`
`69`	`69`
`@@ -77,7 +77,7 @@ public void searchArrayBinarySearch() {`
`77`	`77`
`78`	`78`	`long startTime = System.nanoTime();`
`79`	`79`	`for (int i = 0; i < count; i++) {`
`80`		`- Arrays.binarySearch(strings, "A");`
	`80`	`+ Arrays.binarySearch(strings, "T");`
`81`	`81`	`}`
`82`	`82`	`long duration = System.nanoTime() - startTime;`
`83`	`83`	`//System.out.println("Binary search: " + duration / 10000);`