Part 2: binary search. When binary searching a sorted array that contains more than one key equal to the search key, the client may want to know the index of either the first or the last such key. Accordingly, implement the following API: public class BinarySearchDeluxe { // Returns the index of the first key in the sorted array a[] // that is equal to the search key, or -1 if no such key. public static int firstIndexof (Key[] a, Key key, Comparator comparator) // Returns the index of the last key in the sorted array af] // that is equal to the search key, or -1 if no such key. public static int lastIndexof (Key[] a, Key key, Comparator comparator) // unit testing (required) public static void main (String[ args) } Corner cases. Throw an 1llegalArgumentException if any argument to either firstIndexOf () or lastIndexof () is null. Preconditions. Assume that the argument array is in sorted order (with respect to the supplied comparator). Unit testing. Your main() method must call each public method directly and help verify that they work as prescribed (e.g., by printing results to standard output). Performance requirements. The firstIndexof () and lastIndexof ) methods must make at most 1+ [log, n] compares in the worst case, where n is the length of the array. In this context, a соmpare one call to comparator.compare ().

fast please c++    Insert the elements of A in hash table H of size 10. H is a vector of int is size 10. Do not allow duplicates.  Draw the table. The hash function is the number itself; f(n) = n%10

Design a class that acquires the JSON string from question #1 and converts it to a class data member dictionary.  Your class produces data sorted by key or value but not both.  Provide searching by key capabilities to your class.  Provide string functionality to convert the dictionary back into a JSON string. question #1:  import requestsfrom bs4 import BeautifulSoupimport json class WebScraping:    def __init__(self,url):        self.url = url        self.response = requests.get(self.url)        self.soup = BeautifulSoup(self.response.text, 'html.parser')            def extract_data(self):        data = []        lines = self.response.text.splitlines()[57:] # Skip the first 57 lines        for line in lines:            if line.startswith('#'): # Skip comment lines                continue            values = line.split()            row = {                'year': int(values[0]),                'month': int(values[1]),                'decimal_date': float(values[2]),…

MASM x86 class

Mergesort is a method that takes an integer array and returns a sorted copy of the same array. It first sorts the left half of the input array, then the right half of the input array, and finally merges the two sorted halves together into a sorted version of the input array. Implement the mergesort method    public static int[] mergesort(int[] arr) {         return new int[] {-1};     }     *must be in this layout and done in java

1-Write a JAVA program that reads an array from input file and invokes twodifferent methods Sort and Max ,that sorts the elements of the array and findsthe Max element and writes out the resulted array in to output file . Usetwo interfaces for methods and throw Exception Handling for Out Of Boundindex for the array

1. Goals and Overview The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5. A hash table stores values into a table (meaning an array) at a position determined by a hash function. 2. Hash Function and Values Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the one in object. For this assignments, your hash table stores values of type public class HashKeyValue { K key; V value; } 3. Hash Table using Chained Hashing Create a hash table class (called HashTable211.java) satisfying the following interface: public interface HashInterface { void add(K key, V value); // always succeeds as long as there is enough memory V find (K key); // returns null if there is no such key } Internally, your hash table is defined as a private…