12.27 LAB: Binary search generic method Implement the Searcher class's binarySearch() generic method in the Searcher.java file. Access Searcher.java by clicking on the orange arrow next to BinarySearch.java at the top of the coding window. The method performs a binary search on the sorted array (first parameter) for the key (third parameter). binarySearch () returns the key's index if found, -1 if not found. Compare an array element to the key using the compare ( ) method of the comparer object passed as binary Search ()'s last parameter. comparer.compare(a, b) returns an integer: • greater than 0 if a > b • less than 0 if a

4.4.1: Modify an array parameter.   Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}.

//From what I can tell, the answer provided does not answer my question. Asking again. Please read. Write a Java program that implements both Linear Search and Binary Search. The program willtake a collection of objects (generic type data) as input and print the number of comparisons neededto 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. Youmay 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 fromthe textbook, explain that formula briefly as a comment within your code. 2. Tester.java : This class will contain…

//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 willtake a collection of objects (generic type data) as input and print the number of comparisons neededto 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. Youmay 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 fromthe textbook, explain that formula briefly as a comment within your code.   2.…

import java.util.ArrayList; /*** A class to hold details of audio files.** @author David J. Barnes and Michael Kölling* @version 2011.07.31*/public class MusicOrganizer{// An ArrayList for storing the file names of music files.private ArrayList<String> files;/*** Create a MusicOrganizer*/public MusicOrganizer(){files = new ArrayList<String>();}/*** Add a file to the collection.* @param filename The file to be added.*/public void addFile(String filename){files.add(filename);}/*** Return the number of files in the collection.* @return The number of files in the collection.*/public int getNumberOfFiles(){return files.size();}/*** List a file from the collection.* @param index The index of the file to be listed.*/public void listFile(int index){if(index >= 0 && index < files.size()) {String filename = files.get(index);System.out.println(filename);}}/*** Remove a file from the collection.* @param index The index of the file to be removed.*/public void…

Java Program:  There are errors in the lexer and shank file. Please fix those errors and there must be no error in any of the code at all. Below is the lexer, shank, and token files. The shank file is the main method. There is a rubric attached as well.   Lexer.java   import java.util.ArrayList;import java.util.HashMap;import java.util.List; import mypack.Token.TokenType; public class Lexer { private static final int INTEGER_STATE = 1;private static final int DECIMAL_STATE = 2;private static final int IDENTIFIER_STATE = 3;private static final int SYMBOL_STATE = 4;private static final int ERROR_STATE = 5;private static final int STRING_STATE = 6;private static final int CHAR_STATE = 7;private static final int COMMENT_STATE = 8; private static final char EOF = (char) -1; private static String input;private static int index;private static char currentChar;private static int lineNumber = 1;private static int indentLevel = 0;private static int lastIndentLevel = 0; private static…

Q1  java : If in the ArrayStack, the first element that we push to the stack, is stored in location capacity – 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topOfStack to capacity and we write the push method as follows: public E push(E obj) {        if (topOfStack == 0)              reallocate();        topOfStack--;        theData[topOfStack] = obj;        return obj;  }   This push method can work but the if statement should be:   if (topOfStack == theData.length - 1) reallocate();   This push method will work provided we modify the reallocate method.   This push method can work, but topOfStack-- ; should come after  theData[topOfStack] = obj;   This push method can work, but topOfStack-- ; should be topOfStack++;

Exercise 1• Create a class that sorts a list in ascending order. Make use of the Collections method sort• The list should be a list of Strings.• Test your code with {“Hearts”, “Diamonds”, “Clubs”, “Spades”}• Before and after the sort, use the implicit call to the list’s toString method to output the list contents. Exercise 2• Create a class with the same requirement as in Exercise 1, but the sort should be in descending order• Make use of the Comparator interface• Make use of the static collection method reverseOrder   java

Q6) Answer the following: [2 Marks] a) Write a small code fragment that generates a random integer number using Random class . b) How do you check whether a given key is contained in a map? (Give a Java code example.) c) Create a class MapTester. In it, use a HashMap to implement a phone Book. In this class, implement two methods: public void enterNumber(String name, String number) public String lookupNumber(String name) The methods should use the put and get methods of the HashMap class to implement their functionality

The People class holds an unsorted list of humans. Initially, this list is empty. Existing Human objects may be added to the list using an insert method. Upon inserting a Human object, it is added to the array at the next available position and the position value in incremented. If the position value is equal to the size value, do not insert the Human. Instead, throw an exception that your driver can catch to print an error that the People object is full.   Create a People class with the following features: Each People object has a statically allocated array of Human objects. Size attribute representing the maximum size of the array. Position attribute representing the next free position in the array. Default constructor with no arguments. Search method that takes a string argument and returns a Human object. This method returns the first Human object with a name matching the string argument. In other words, pass the name of a Human as a string, search the list of humans for…