Write a template version of the iterative binary search algorithm from Display 13.8 which only searches an array of integers for an integer key. Specify requirements on the template parameter type. Discuss the requirements on the template parameter type.

Create a class called AddressBook that uses either C++ - Vector in the data section of the class. Since this is a template / generic type you need to make sure that you specify that ArrayList or vector  will hold a Person. You should use the Person class you created in Assignment 1.  Essentially, we are creating a collection class.  In other words, the AddressBook class will be a collection of Person classes.  Constructors AddressBook(); - default constructor. Should have no functionality.  AddressBook(string first, string last);  - Adds a Person class to the collection and sets address field to an empty string AddressBook(string first, string last, string address); - Adds a Person class to the collection. Mutators setPerson(string first, string last, string address); - Adds a Person to the collection Accessors C++  All accessors will return a pointer to a Person Person *getPerson(); - Returns the next Person in the collection. Each time this function is called it will return the…

//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.…

please include a picture of the program and the output too and thank you!!!

Write a template function that takes as parameter a vector of a generic type and reverses the order of elements in the vector, and then add the function to the program you wrote for Programming Challenge 5. Modify the driver program to test the new function by reversing and outputting vectors whose element types are char, int, double, and string.

A) Consider the generic print() method, write a method that takes an array of E, where E must be Comparable or extend a type that is Comparable, and returns a reference to the greatest object in the array.  In this case, the greatest value is one for which compareTo() would return 0 or more for any other object in the array.  If there is more than one possible largest value (these would have to be equal to each other but greater than any other objects in the array), it does not matter which one you choose.  B) Write a generic Java queue class (a plain queue, not a priority queue).  Call it GenericQueue, because the JDK already has an interface called Queue.  The class must be able to create a queue of objects of any reference type. Consider the GenericStack class shown in the lecture notes for some hints.  Like the Stack, the GenericQueue should use an underlying ArrayList<E>.  Write these methods and any others you find useful: enqueue() adds an E to the queue peek() returns a…

Implement in C Programming 6.11.2: Modify an array parameter. Write a function SwapArrayEnds() that swaps the first and last elements of the function's array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. #include <stdio.h> /* Your solution goes here  */ int main(void) {   const int SORT_ARR_SIZE = 4;   int sortArray[SORT_ARR_SIZE];   int i;   int userNum;    for (i = 0; i < SORT_ARR_SIZE; ++i) {      scanf("%d", &sortArray[i]);   }    SwapArrayEnds(sortArray, SORT_ARR_SIZE);    for (i = 0; i < SORT_ARR_SIZE; ++i) {      printf("%d ", sortArray[i]);   }   printf("\n");    return 0;}

Add the function min as an abstract function to the class arrayListType to return the smallest element of the list. Also, write the definition of the function min in the class unorderedArrayListType and write a program to test this function. I have 5 tabs: I have tried every solution I can think of with no luck. These are the guides: arrayListType.h arrayListTypeImp.cpp: main.cpp unorderedArraryListType.h unorderedArrayListTypeImp.cpp I am needing these in order to pass the assignment in Cengage Mindtap, please help with codes for each one if possible.

Implement the following functions. Each function deals with null terminated C-Style strings. You can assume that any char array passed into the functions will contain null terminated data. Place all of the functions in a single file and then (in the same file) create a main() function that tests the functions thoroughly. You will lose points if you don't show enough examples to convince me that your function works in all cases. Please note the following: You may not use any variables of type string. This means that you should not #include <string>. Also, you may not use any c-string functions other than strlen(). If you use any other c-string functions, you will not get credit. Note, however, that functions such as toupper(), tolower(), isalpha(), isspace(), and swap() are NOT c-string functions, so you can use them. Also note that this prohibition is only for the functions that you are assigned to write. You can use whatever you want in your main() function that tests the…

Write a java program that uses an ArrayList object to store the following set of names in memory: [Steve, Tim, Lucy, Pat, Angela, Tom] Now write some more code so that the same ArrayList object is augmented with the name 'Steve' after the name 'Lucy' After the ArrayList object has been augmented with the new name, display the original and new lists on the console (as shown below), to verify that the new name is positioned correctly in the list.