Answered: n Asking this question again as the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

#2.

Again Asking this question again as the answer I was provided did not appear to follow the instructions of the question below

Write a Java program that implements both Linear Search and Binary Search. The program will
take a collection of objects (generic type data) as input and print the number of comparisons needed
to find a target element within that collection.
You will create the following two Java classes:

1. SearchCombo.java : Code for both linearSearch and binarySearch will be in this class. You
may take help from the textbook Chapter 9, Section 9.1. However, note that the design require-
ments are different from the textbook code.
•Both search methods must use the Comparable<T> interface and the compareTo() method.
•Your program must be able to handle different data types, i.e., use generics.
•For binarySearch, if you decide to use a midpoint computation formula that is different from
the textbook, explain that formula briefly as a comment within your code.

2. Tester.java : This class will contain the main() method. The user will be asked to enter the
collection of elements (comma or space can be used to separate the elements). The output will
be the number of comparisons the two searching techniques require.
Review the sample output given below to get an idea of what the program output should look like.
Your output may include additional information.

[Note: The output of the image below shows dummy values for # of comparisons]
In your submission, include screenshots showing the results for the following two collections:
10 12 18 22 31 34 40 46 59 67 69 72 80 84 98
-2.20 -1.10 1.10 2.20 3.30 4.40 5.50 6.60 7.70 8.80 9.90
You may include additional results for other collections if you want...

Enter the elements (search pool):
1 12 18 22 31 34 40 46 59 67 85
Target:
40
# of comparisons for Linear Search: 4
# of comparisons for Binary Search: 2
Enter the elements (search pool):
1 12 18 22 31 34 40 46 59 67 85
Target:
100
Not found!
# of comparisons for Linear Search: 8
Not found!
# of comparisons for Binary Search: 5

Expert Solution

Step by step

Solved in 3 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions