pleas note that I\'m using Dr-Java Windows Write a Java program to search two ar
ID: 3835584 • Letter: P
Question
pleas note that I'm using Dr-Java Windows
Write a Java program to search two arrays of the same 1000 random integers in order to test the efficiency of sequential and binary searches.
You will use the P10Class here:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
public class P10Class
{
public static int SEQ_NUM;
public static int BIN_NUM;
public static int seq_search(int[] data, int key)
{
boolean found = false;
int i = 0;
SEQ_NUM = 0;
while ( !found && (i < data.length) )
{
if ( data[i] == key )
found = true;
else
i++;
SEQ_NUM++;
}
if ( found )
return i;
else
return -1;
}
public static int bin_search(int[] data, int key)
{
boolean found = false;
int midpoint = 0, first = 0, last;
BIN_NUM = 0;
last = data.length - 1;
while ( ( first <= last ) && !found )
{
midpoint = (first + last) / 2;
if ( data[midpoint] == key )
found = true;
else if ( data[midpoint] > key )
last = midpoint - 1;
else
first = midpoint + 1;
BIN_NUM++;
}
if ( found )
return midpoint;
else
return -1;
}
}
This class is designed to test the efficiency of the two search models.
You will simultaneously populate both arrays with the same random numbers. This will guarantee that both arrays have the exact same content. Sort only ONE array using Arrays.sort(). This sorted array will be used with the bin_search() method and the unsorted array will be used with seq_search().
Write code to read integers from System.in until EOF. With each integer search each array using seq_search() and bin_search(). Report the number of elements examined for each search method, whether or not the item was found and where in the array you found it.
The number of array elements examined is stored in static instance variables. These variables for sequential and binary search are SEQ_NUM and BIN_NUM respectively. The appropriate variable is set when the corresponding search method is called.
Your output should resemble the following:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
public class P10Class
{
public static int SEQ_NUM;
public static int BIN_NUM;
public static int seq_search(int[] data, int key)
{
boolean found = false;
int i = 0;
SEQ_NUM = 0;
while ( !found && (i < data.length) )
{
if ( data[i] == key )
found = true;
else
i++;
SEQ_NUM++;
}
if ( found )
return i;
else
return -1;
}
public static int bin_search(int[] data, int key)
{
boolean found = false;
int midpoint = 0, first = 0, last;
BIN_NUM = 0;
last = data.length - 1;
while ( ( first <= last ) && !found )
{
midpoint = (first + last) / 2;
if ( data[midpoint] == key )
found = true;
else if ( data[midpoint] > key )
last = midpoint - 1;
else
first = midpoint + 1;
BIN_NUM++;
}
if ( found )
return midpoint;
else
return -1;
}
}
Explanation / Answer
P10ClassTest.java
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class P10ClassTest {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
Random r = new Random();
int a[]= new int[1000];
for(int i=0;i<a.length;i++){
a[i]=r.nextInt(1000);
}
System.out.println(a.length+" random numbers from 0 to 999 have been generated ");
while(true){
System.out.print("Enter an integer to search the arrays (EOF to stop): ");
int search = scan.nextInt();
System.out.println("sequential search found the value "+search+" in element "+P10Class.SEQ_NUM+" with "+P10Class.seq_search(a, search)+" items scanned. ");
Arrays.sort(a);
System.out.println("binary search found the value "+search+" in element "+P10Class.BIN_NUM+" with "+P10Class.bin_search(a, search)+" items scanned. ");
}
}
}
P10Class.java
public class P10Class
{
public static int SEQ_NUM;
public static int BIN_NUM;
public static int seq_search(int[] data, int key)
{
boolean found = false;
int i = 0;
SEQ_NUM = 0;
while ( !found && (i < data.length) )
{
if ( data[i] == key )
found = true;
else
i++;
SEQ_NUM++;
}
if ( found )
return i;
else
return -1;
}
public static int bin_search(int[] data, int key)
{
boolean found = false;
int midpoint = 0, first = 0, last;
BIN_NUM = 0;
last = data.length - 1;
while ( ( first <= last ) && !found )
{
midpoint = (first + last) / 2;
if ( data[midpoint] == key )
found = true;
else if ( data[midpoint] > key )
last = midpoint - 1;
else
first = midpoint + 1;
BIN_NUM++;
}
if ( found )
return midpoint;
else
return -1;
}
}
Output:
1000 random numbers from 0 to 999 have been generated
Enter an integer to search the arrays (EOF to stop): 888
sequential search found the value 888 in element 0 with 632 items scanned.
binary search found the value 888 in element 0 with 880 items scanned.
Enter an integer to search the arrays (EOF to stop): 999
sequential search found the value 999 in element 633 with 998 items scanned.
binary search found the value 999 in element 10 with 998 items scanned.
Enter an integer to search the arrays (EOF to stop):
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.