This is a short answer question
Implement the following method that returns the maximum element in an array. (6 pts)
public static <T extends Comparable<E>> E MaxInArray(T[] array)
{ … }
public static <T extends Comparable<T>> T
MaxInArray(T[] array)
{
T max = array[0];
for(int i = 1; i < array.length; i++){
if(array[i].compareTo(max) > 0)
max = array[i];
}
return max;
}
This is a short answer question Implement the following method that returns the maximum element in...
"Java question" Implement a generic method that returns the minimum element in an array. public static<EextendsComparable<E>> E min(E[ ] list)
(Maximum element in ArrayList) Write the following method that returns the maximum value in an ArrayList of integers. The method returns null if the list is null or the list size is 0. public static Integer max(ArrayList<Integer> list) Write a test program that prompts the user to enter a sequence of numbers ending with 0, and invokes this method to return the largest number in the input. Use inheritance and polymorphism approach.
Write a method max() which take a generic singly linked list as an argument and returns the maximum element reference in the list. If the list is empty, please throw an empty collection exception. The method prototype is defined as follows. Please write down your code in the method body enclosed in braces: public static <T extends Comparable<T>> T max(SingleLinkedList<T> list) throws EmptyCollectionException { } 2) What is the big O notation of the max method? a) O(N)...
Can someone help me with the main class of my code. Here is the assignment notes. Implement project assignment �1� at the end of chapter 18 on page 545 in the textbook. Use the definition shown below for the "jumpSearch" method of the SkipSearch class. Notice that the method is delcared static. Therefore, you do not need to create a new instance of the object before the method is called. Simply use "SkipSearch.jumpSearch(...)" with the appropriate 4 parameter values. When...
public class SelectionSorter { //Returns the index of the largest element in the arrayOfIntegers, beginning from the fromIndex. public static Integer[] selectSort(Integer[] incoming) { Integer[] ret = new Integer[incoming.length]; for (int i = 0; i < incoming.length; i++) { ret[i] = incoming[i]; } int temp = 0; for (int i = 0; i < ret.length - 1; i++) { if (ret[i] > ret[i + 1]) {...
Check if an array is a heap in Java. Complete the method isHeapTree Together, these methods are meant to determine if an array of objects corresponds to a heap. The methods are generic, and they should work with an array of any type T that implement Comparable<T>. Implement the second method so that it uses recursion to process the complete tree/subtree whose root is at position i in the array arr. The method should return true if that tree/subtree is...
Part 1. Primitive Types, Sorting, Recursion for Homework.java a) Implement the static method initializeArray that receives as a parameter an array of integers. Use a for loop and an if statement to put 0s in the odd positions of the array and 5s in the even positions. b) Implement the static method printArray that receives as a parameter an array of integers. Use a for statements to print all the elements in the array. c) Implement the static method insertionSort...
(1) Implement the countKey(T element) method, which should return a count of the number of times that the given key (the element) is found in the list. (2) Implement the indexOf(T element) method, which is similar as the indexOf method in the String class. It returns the index (the position starting from the head node) of the first occurrence of the given element, or -1, if the element does not occur in the list. You will need to track the...
*Java* Hi. I need some help with creating generic methods in Java. Write a program GenMethods that has the following generic methods: (1) Write the following method that returns a new ArrayList. The new list contains the nonduplicate (i.e., distinct) elements from the original list. public static ArrayList removeDuplicates(ArrayList list) (2) Write the following method that shuffles an ArrayList. It should do this specifically by swapping two indexes determined by the use of the random class (use Random rand =...
You must implement the following methods using Java's Stack Object. /** * Computes the factorial of n * @param n-integer value greater or equal to 0 * @return n! */ public static int factorial( int n ) { } /** * Computes the nth term of the Fibonacci sequence * @param n -nth term to find * @return -the nth term */ public static int fibonacci( int n ) {} /** * Find the min value using the comparable interface...