Chef wants to allow the A-elements in such a way that it will satisfy the following condition: there is a whole number p (1

So how fast is the merge sort? Does it depend on the type of array? We saw with some of our previous sorts that it depended on the initial array. For example, an Insertion sort was much faster for a nearly sorted array. In this exercise, you are given the Sorter class, which contains a static mergeSort method that takes an int array and length as an input. You are also given the SortTester class which has three static methods for creating 3 different types of arrays. For this test, create one of the three arrays, then take a start time using System.currentTimeMillis(). Next, run the array through the mergeSort method in the Sorter class. Finally, record the end time and print out the results. Repeat this for the other two array types. Sample Output Random Array: ** Results Hidden ** Almost Sorted Array: ** Results Hidden ** Reverse Array: ** Results Hidden **

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…

Write the implementation of a static method, called evenElements, that takes one input parameter, called inputS, of type IntStackInterface. The method extracts all even numbers from inputS and returns as output an IntArrayStack that includes all the extracted numbers. All other odd or zero elements must remain in inputS unchanged and in the same order.

The ADT Set can store a collection of elements in any order but without duplications. For example: {1,2,3} is a set with three elements, but {1,2,2,3} is not a set because 2 occurs twice. • Give the names of the essential methods for this ADT. • Give pseudo-code for an implementation of these methods.

JAVA PROGRAMMING I currently have a string method which changes accented letters to just normal letters: e.g. ("é", “e"} {"B", "s"} It is currently doing this using a linear search. However, I want to make a hash map which will reduce the time complexity of this operation. I require the hash map implementation files which cannot use *ANY* java.util packages, they have to be written from scratch, for the hash map, key, value, and linked list etc... I then also need to understand how to implement this hash map into my current class where l have a static method to initialise variables and then a public static method to implement the hash map.

Java language

Question in java Arraylist Please help fast

in c++ plz

JAVA PROGRAMMING   I currently have a string method which changes accented letters to just normal letters: e.g. {“é”, “e”} {“ß”, “s”} It is currently doing this using a linear search. However, I want to make a hash map which will reduce the time complexity of this operation. I require the hash map implementation files which cannot use *ANY* java.util packages, they have to be written from scratch, for the hash map, key, value, and linked list etc… I then also need to understand how to implement this hash map into my current class where I have a static method to initialise variables and then a public static method to implement the hash map.