import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet { // Define a method named linearSearch that takes in a Set and an integer target // as parameters public static boolean linearSearch(Set set, int target) { // Iterate over all elements in the Set for () { // Check if the current value is equal to the target if () { // If so, return true } } // If the target was not found, return false } // Define the main method public static void main(String[] args) { // Create a HashSet of integers and populate integer values Set numbers = new HashSet<>(); // Define the target to search for numbers.add(3); numbers.add(6); numbers.add(2); numbers.add(9); numbers.add(11); // Call the linearSearch method with the set and target as arguments boolean result = linearSearch(numbers, target); // Check the result and print the appropriate message if (result) { System.out.println("Target found in the Set."); } else { System.out.println("Target not found in the Set."); } } } --------------------------------------------------------------------------------------------------------------------------------------------------------- Define the class LinearSearchSet: This class will contain the method to perform a linear search on a Set of integers. Define the linearSearch method: This method takes in a Set of integers and an integer target as parameters. The method uses a for-each loop to iterate over all of the elements in the Set. For each element, the method checks if the current value is equal to the target. If the target is found, the method returns true. If the loop completes and the target was not found, the method returns false. Define the main method: In this method, create a HashSet of integers called numbers and add the following integers to it: Copy 1 2 3 4 5 6 Set numbers = new HashSet<>(); numbers.add(3); numbers.add(6); numbers.add(2); numbers.add(9); numbers.add(11); Your target is an integer with a value of 6. Call the linearSearch method with the set and the target as arguments. Store the result of the search as a boolean variable called result. If the result is true, the message "Target found in the Set." should be printed to the console. If the result is false, the message "Target not found in the Set." should be printed to the console.

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
icon
Related questions
Question
import java.util.HashSet;
import java.util.Set;

// Define a class named LinearSearchSet
public class LinearSearchSet {

    // Define a method named linearSearch that takes in a Set and an integer target
    // as parameters
    public static boolean linearSearch(Set<Integer> set, int target) {
        // Iterate over all elements in the Set
        for () {
            // Check if the current value is equal to the target
            if () {
                // If so, return true

            }
        }
        // If the target was not found, return false

    }

    // Define the main method
    public static void main(String[] args) {
        // Create a HashSet of integers and populate integer values
        Set<Integer> numbers = new HashSet<>();


        // Define the target to search for
        numbers.add(3);
        numbers.add(6);
        numbers.add(2);
        numbers.add(9);
        numbers.add(11);

        // Call the linearSearch method with the set and target as arguments
        boolean result = linearSearch(numbers, target);
        // Check the result and print the appropriate message
        if (result) {
            System.out.println("Target found in the Set.");
        } else {
            System.out.println("Target not found in the Set.");
        }
    }
}
---------------------------------------------------------------------------------------------------------------------------------------------------------
  1. Define the class LinearSearchSet:

    • This class will contain the method to perform a linear search on a Set of integers.

  2. Define the linearSearch method:

    • This method takes in a Set of integers and an integer target as parameters.

    • The method uses a for-each loop to iterate over all of the elements in the Set.

    • For each element, the method checks if the current value is equal to the target.

    • If the target is found, the method returns true.

    • If the loop completes and the target was not found, the method returns false.

  3. Define the main method:

    • In this method, create a HashSet of integers called numbers and add the following integers to it:

      Copy
       
       
      1
      2
      3
      4
      5
      6
      Set<Integer> numbers = new HashSet<>();
      numbers.add(3);
      numbers.add(6);
      numbers.add(2);
      numbers.add(9);
      numbers.add(11);
       
       
    • Your target is an integer with a value of 6.

    • Call the linearSearch method with the set and the target as arguments.

    • Store the result of the search as a boolean variable called result.

    • If the result is true, the message "Target found in the Set." should be printed to the console.

    • If the result is false, the message "Target not found in the Set." should be printed to the console.

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Generic Type
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education