(Sort ArrayList) Write the following method that sorts an ArrayList.pdf

•

0 likes•2 views

(Sort ArrayList) Write the following method that sorts an ArrayList: public static > void sort(ArrayList list JAVA Solution import java.util.ArrayList; /** * @author * */ public class GenericSort { /** * method to sort the list * * @param list */ public static > void sort(ArrayList list) { Object currentMax; int currentMaxIndex; for (int i = list.size() - 1; i >= 1; i--) { // Find the maximum in the list[0..i] currentMax = list.get(i); currentMaxIndex = i; for (int j = i - 1; j >= 0; j--) { if (((Comparable) currentMax).compareTo(list.get(j)) < 0) { currentMax = list.get(j); currentMaxIndex = j; } } // Swap list[i] with list[currentMaxIndex] if necessary; if (currentMaxIndex != i) { list.set(currentMaxIndex, list.get(i)); list.set(i, (E) currentMax); } } } /** * @param args */ public static void main(String[] args) { Integer[] intArray = { new Integer(2), new Integer(4), new Integer(3) }; // Create a String List ArrayList stringList = new ArrayList(); stringList.add(\"Srinivas\"); stringList.add(\"Pavan\"); stringList.add(\"Kishore\"); stringList.add(\"Rajesh\"); stringList.add(\"Charkri\"); // Create a int List ArrayList intList = new ArrayList(); intList.add(20); intList.add(30); intList.add(10); intList.add(40); intList.add(90); intList.add(50); System.out.println(\"Before sorting :\"); System.out.println(stringList); System.out.println(intList); // Sort the arrays sort(stringList); sort(intList); System.out.println(\"After sorting :\"); System.out.println(stringList); System.out.println(intList); } } OUTPUT: Before sorting : [Srinivas, Pavan, Kishore, Rajesh, Charkri] [20, 30, 10, 40, 90, 50] After sorting : [Charkri, Kishore, Pavan, Rajesh, Srinivas] [10, 20, 30, 40, 50, 90].

Education

}
}
/**
* @param args
*/
public static void main(String[] args) {
Integer[] intArray = { new Integer(2), new Integer(4), new Integer(3) };
// Create a String List
ArrayList stringList = new ArrayList();
stringList.add("Srinivas");
stringList.add("Pavan");
stringList.add("Kishore");
stringList.add("Rajesh");
stringList.add("Charkri");
// Create a int List
ArrayList intList = new ArrayList();
intList.add(20);
intList.add(30);
intList.add(10);
intList.add(40);
intList.add(90);
intList.add(50);
System.out.println("Before sorting :");
System.out.println(stringList);
System.out.println(intList);
// Sort the arrays
sort(stringList);
sort(intList);
System.out.println("After sorting :");
System.out.println(stringList);
System.out.println(intList);
}
}
OUTPUT:
Before sorting :
[Srinivas, Pavan, Kishore, Rajesh, Charkri]

[20, 30, 10, 40, 90, 50]
After sorting :
[Charkri, Kishore, Pavan, Rajesh, Srinivas]
[10, 20, 30, 40, 50, 90]

Similar to (Sort ArrayList) Write the following method that sorts an ArrayList.pdf

FOR MORE CLASSES VISIT www.tutorialoutlet.com Below is a given ArrayList class and Main class in search algorithms. Please modify the existing program so it can time the sequential search and the binary search methods several times each for randomly generated values, and record the results in a table. Do not time individual searches, but groups of them. For example, time 100 searches together or 1,000 searches together. Compare the running times of these two search methods that are obtained during the experiment.

Below is a given ArrayList class and Main class Your Dreams Our Mission/tuto...

davidwarner122

In Java code, implement the HeapSort algorithm. Your function must t.pdf

arrowcomputers8700

2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended by the addition of two new methods: //Interface: ArrayListADT //works for int public interface ArrayListADT { public boolean isEmpty(); //Method to determine whether the list is empty. public boolean isFull(); //Method to determine whether the list is full. public int listSize(); //Method to return the number of elements in the list. public int maxListSize(); //Method to return the maximum size of the list. public void print(); //Method to output the elements of the list. public boolean isItemAtEqual(int location, int item); //Method to determine whether item is the same as the item in the list at location. public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at the position public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list. public void removeAt(int location); //Method to remove the item from the list at location. public int retrieveAt(int location); //Method to retrieve the element from the list at location. public void replaceAt(int location, int repItem); //Method to replace the element in the list at location with repItem. public void clearList(); //Method to remove all the elements from the list. public int search(int searchItem); //Method to determine whether searchItem is in the list. public void remove(int removeItem); //Method to remove an item from the list. } //Class: ArrayListClass implements //Interface: ArrayListADT public abstract class ArrayListClass implements ArrayListADT { protected int length; //to store the length of the list protected int maxSize; //to store the maximum size of the list protected int[] list; //array to hold the list elements //Default constructor public ArrayListClass() { maxSize = 100; length = 0; list = new int[maxSize]; } //Alternate Constructor public ArrayListClass(int size) { if(size <= 0) { System.err.println(\"The array size must be positive. Creating an array of size 100.\"); maxSize = 100; } else maxSize = size; length = 0; list = new int[maxSize]; } public boolean isEmpty() { return (length == 0); } public boolean isFull() { return (length == maxSize); } public int listSize() { return length; } public int maxListSize() { return maxSize; } public void print() { for (int i = 0; i < length; i++) System.out.print(list[i] + \" \"); System.out.println(); } public boolean isItemAtEqual(int location, int item) { if (location < 0 || location >= length) { System.err.println(\"The location of the item to be compared is out of range.\"); return false; } return list[location]== item; } public void clearList() { for (int i = 0; i < length; i++) list[i] = 0; length = 0; System.gc(); //invoke the Java garbage collector } public void removeAt(int location) { if (location < 0 || location >= length) System.err.println(\"The location of the item to be removed is out of range.\"); else { for(int i = location; i < length - 1; i++) list[i] .

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

arshin9

Java Generics

Zülfikar Karakaya

Array list

vishal choudhary

Please help me to make a programming project I have to sue them today. Please help me make a UnsortedList and SortedList classes. The instructor give me The code of the List and AbstracList Classes that 2 pages we do not modify them. Do not modify this pages!!! List.java import java.util.Iterator; /** * Represents List interface. * * @author Varik Hoang * @version Sep 26, 2016 * @param is of any object type. */ public interface List { /** * The method returns the current number of elements in the list. * * @return the current number of elements in the list greater than or equal 0 */ public int getSize(); /** * The method returns whether the list is empty. * * @return true if list is empty, false otherwise. */ public boolean isEmpty(); /** * The method returns whether value is in the list. * * @param value the value is assigned * @return true if value in the list, false otherwise. */ public boolean contains(Type value); /** * The method inserts an element into the list. * * @param value the value is assigned */ public void insert(Type value); /** * The method clears the list. */ public void clear(); /** * The method returns a string representation of list contents. * * @return a string representation of list contents. * @see Object#toString() */ @Override public String toString(); /** * /** * The method removes first element occurrence from the list. * * @param value the value is assigned * @return the removed value */ public Type remove(Type value); /** * The method returns the index of value. * * @param value the value is assigned. * @return the index of value if in the list, -1 otherwise. */ public int getIndex(Type value); /** * The method removes value at the given index. * * @param index the index must be in range of 0 and size * @return the removed value * @throws IndexOutOfBoundsException if index less than 0 or index greater than * or equal size */ public Type removeAtIndex(int index); /** * The method replaces the value at the given index with the given value. * * @param index the index must be in range of 0 and size * @param value the value is assigned * @throws IndexOutOfBoundsException if index less 0 or index greater than size */ public void set(int index, Type value); /** * Returns the value at the given index in the list. * * @param index the index must be in range of 0 and size * @throws IndexOutOfBoundsException if index less than 0 or greater size * @return the value at the given index in the list. */ public Type get(int index); /** * The method returns an iterator for this list. * * @return an iterator for the list. */ public Iterator iterator(); } Do not modify this pages public abstract class AbstractList implements List { /** * The reference to the last element */ protected ListNode tail; /** * The size of the list */ protected int size; /** * The constructor that initiate the tail and size references */ public AbstractList() { tail = null; size = 0; } @Override public int getSize() { return size; } @Override public bool.

Please help me to make a programming project I have to sue them today- (1).pdf

seoagam1

Collection and framework

SARAVANAN GOPALAKRISHNAN

Implement the ListArray ADT-Implement the following operations.pdf

petercoiffeur18

Write a java class \"LIST\" that outputs: //main: public class AssignmentThree { public static void main(String[] args) { List myList = new List(15); // Cause List Empty Message myList.removeFront(); myList.removeRear(); myList.removeItem(\"a\"); // Cause Not found message myList.addToFront(\"x\"); myList.removeItem(\"y\"); myList.removeItem(\"x\"); myList.addAfterItem(\"x\", \"z\"); myList.addBeforeItem(\"x\", \"z\"); // Normal behavior myList.addToFront(\"not.\"); myList.addToFront(\"or\"); myList.addToRear(\"is\"); myList.addToRear(\"try.\"); myList.addAfterItem(\"is\", \"no\"); myList.addBeforeItem(\"is\", \"There\"); myList.addToFront(\"Do\"); myList.addAfterItem(\"or\", \"do\"); myList.print(\"Original list\"); myList.printSorted(\"Sorted Original List\"); sop(\"\ Front is \" + myList.getFront()); sop(\"Rear is \" + myList.getRear()); sop(\"Count is \" + myList.askCount()); sop(\"Is There present? \" + myList.isPresent(\"There\")); sop(\"Is Dog present? \" + myList.isPresent(\"Dog\")); myList.addToFront(\"junk\"); myList.addToRear(\"morejunk\"); myList.addAfterItem(\"or\", \"moremorejunk\"); myList.print(\"List with junk\"); sop(\"Count is \" + myList.askCount()); myList.removeFront(); myList.removeRear(); myList.removeItem(\"moremorejunk\"); myList.print(\"List with junk removed\"); sop(\"Count is \" + myList.askCount()); sop(\"\"); // Cause List Full message for(int ii = 0; ii < 10; ++ii) { myList.addToFront(DUMMY); } myList.addToRear(DUMMY); myList.addBeforeItem(\"no\", DUMMY); myList.addAfterItem(\"There\", DUMMY); myList.print(\"After filling List\"); sop(\"Count is \" + myList.askCount()); while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY); myList.print(\"After removing \" + DUMMY ); sop(\"Count is \" + myList.askCount()); } private static void sop(String s) { System.out.println(s); } private static final String DUMMY = \"dummy\"; } //Class List: public class List { public List(int size) { } public void addToFront(java.lang.String item) { } public void addToRear(java.lang.String item) { } public void addBeforeItem(java.lang.String beforeItem, java.lang.String item) { } public void addAfterItem(java.lang.String afterItem, java.lang.String item) { } public java.lang.String getFront() { } public java.lang.String getRear() { } public boolean isPresent(java.lang.String item) { } public int askCount() { } public void removeFront() { } public void removeRear() { } public void removeItem(java.lang.String item) { } public void print(java.lang.String title) { } public void printSorted(java.lang.String title) { } } Solution The List is the base interface for all list types, and the ArrayList and LinkedList classes are two common List’s implementations. Besides ArrayList and LinkedList, Vector class is a legacy collection and later was retrofitted to implement the Listinterface. Vector is thread-safe, but ArrayList and LinkedList are not. The following class diagram depicts the inheritance tree of the List collections. It’s a good practi.

Write a java class LIST that outputsmainpublic class Ass.pdf

ebrahimbadushata00

Hi,I have added the methods and main class as per your requirement.pdf

annaelctronics

Array list (java platform se 8 )

charan kumar

Selection sort

zahraa F.Muhsen

ReversePoem.java :- --------------------------------- public class ReversePoem { /*This programs has you display a pessimistic poem from a list of phrases*/ // and then reverse the phrases to find another more optimistic poem. public static void main(String[] args) throws Exception { //Queue object MyQueue queue = new MyQueue<>(); //Stack object MyStack stack = new MyStack<>(); //String buffer to apppend all Strings StringBuffer sb = new StringBuffer(); // Create a single String object from the 16 Strings below String set1 = \"I am part of a lost generation#and I refuse to believe that#\"; sb.append(set1); String set2 = \"I can change the world#I realize this may be a shock but#\"; sb.append(set2); String set3 = \"\'Happiness comes from within\'#is a lie, and#\"; sb.append(set3); String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\"; sb.append(set4); String set5 = \"they are not the most important thing in my life#\"; sb.append(set5); String set6 = \"My employer will know that#I have my priorities straight because#\"; sb.append(set6); String set7 = \"work#is more important than#family#I tell you this#\"; sb.append(set7); String set8 = \"Once upon a time#Families stayed together#\"; sb.append(set8); String set9 = \"but this will not be true in my era#\"; sb.append(set9); String set10 = \"This is a quick fix society#Experts tell me#\"; sb.append(set10); String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my divorce#\"; sb.append(set11); String set12 = \"I do not concede that#I will live in a country of my own making#\"; sb.append(set12); String set13 = \"In the future#Environmental destruction will be the norm#\"; sb.append(set13); String set14 = \"No longer can it be said that#My peers and I care about this earth#\"; sb.append(set14); String set15 = \"It will be evident that#My generation is apathetic and lethargic#\"; sb.append(set15); String set16 = \"It is foolish to presume that#There is hope#\"; sb.append(set16); String finalString = sb.toString(); String itmes[] = finalString.split(\"#\"); System.out.println(\"========== Original Phrase ==============\"); for(int i = 0 ; i < itmes.length;i++){ queue.enqueue(itmes[i]); System.out.println(itmes[i]); } for(int i = 0 ; i < itmes.length;i++){ stack.push(queue.dequeue()); } System.out.println(\"========== Reverse Phrase ==============\"); for(int i = 0 ; i < itmes.length;i++){ System.out.println(stack.pop()); } /* You are given a list of phrases in Strings; the phrases are separated by pound signs: \'#\': 1. Create a single String object from this list. 2. Then, split the String of phrases into an array of phrases using the String split method. 3. Display a poem by walking through the array and displaying each phrase one per line. 4. And, at the same time, place each phrase on a MyQueue object using only the enqueue method. 5. After all the phrases have been placed on the queue, transfer the phrases from the MyQueue object to a MyS.

ReversePoem.java ---------------------------------- public cl.pdf

ravikapoorindia

you will implement some sorting algorithms for arrays and linked lists. Insertion Sort and Quicksort of an array Implement the insertion sort and quicksort for an integer array. The functions are defined in the "sorting.h" header file. /** * @brief Insertion sort algorithm * @param array Array to be sorted. The array is modified in place. * @param lowindex Lowest index of the array * @param highindex Highest index of the array * @param reversed If reversed = true, the array should be sorted in descending order, otherwise in ascending order */ void insertionSort(int array[], int lowindex, int highindex, bool reversed = false); and ** * @brief Quick sort algorithm * * @param array Array to be sorted. The array is modified in place. * @param lowindex Lowest index of the array * @param highindex Highest index of the array * @param reversed If reversed = true, the array should be sorted in descending order, otherwise in ascending order */ void quickSort(int array[], int lowindex, int highindex, bool reversed = false); The array should be sorted in place. Compared to the examples in the textbook, those functions have an additional parameter reversed. If reversed = true, the array should be sorted in descending order, otherwise in ascending order. You should complete the implementations of those two functions in the "sorting_basic.cpp" file. A better quicksort algorithm Quicksort is a very fast comparison sorting algorithm, especially wheb the array or list gets large. However, when the arrays/lists are small enough, quicksort may run slower than some of the (n^2) algorithms. This might not seem important until you note that when sorting a large array with quicksort, many small sublists must be sorted. While the savings on sorting one small list with a faster algorithm might be negligible, sorting hundreds of small lists with a faster algorithm can make a difference in the overall efficiency of the sort. For this part of the assignment, you will combine quicksort with another sorting algorithm to build a faster sorting algorithm. One option is to use quicksort until the array/list gets small enough, and then use insertion sort or another sort to sort the small arrays/lists What does "small enough" mean? You can try a percentage of the list (say, 5% or 10%), or an absolute number (5 elements, 8 elements, 10 elements, 15 elements, 100 elements, etc), or something else of your choosing. Based on your tests, choose the one that is the most efficient. You should also tests to ensure that your hybrid quicksort has reasonable performance on all lists -- most notably, it should be efficient on sorted and inverse sorted lists as well as random lists. The definition of the hybrid quicksort function is as the following: /** * @brief A hybrid of insertion sort and quick sort algorithm. The algorithm is based on the idea that if the array is short, it is better to use insertion sort. * It uses quicksort until the list gets small enough, and then uses insertion s.

you will implement some sorting algorithms for arrays and linked lis.pdf

info335653

I need help creating a parametized JUnit test case for the following class. import java.util.Arrays; import java.util.Collections; import java.util.LinkedList; import java.util.List; import static java.lang.Integer.valueOf; public class IntegerSet { /** * The only instance variable in the class. No other variables allowed. */ private List list; public int size() { return list.size(); } public boolean isEmpty() { return list.isEmpty(); } /** * Initializes the empty set. */ public IntegerSet() { list = new LinkedList(); } /** * Initializes a set with the numbers in the argument. */ public IntegerSet(Integer[] integers) { this(); if (integers == null) { throw new NullPointerException(\"The argument cannot be null\"); } else { for (Integer i : integers) { if (!exists(i)) { this.insertElement(i); } } } Collections.sort(list); } /** * Inserts an integer to the set if the integer does not exist in the set */ public void insertElement(int i) { if (!list.contains(i)) { list.add(i); } } /** * Inserts to the set all the integers in the argument which do not exist in * the set. */ public void insertAll(Integer[] data) { if (data == null) { throw new NullPointerException(\"The argument cannot be null\"); // throw new // IllegalArgumentException(\"The argument cannot be null\"); } else { Arrays.sort(data); for (Integer num : data) { if (!exists(num)) { insertElement(num); } } } } /** * Deletes an integer from the set if it exists in the set. */ public void deleteElement(int i) { list.remove(i); } /** * Deletes all the elements in the set. */ public void deleteAll() { list.clear(); } /** * Returns true if the argument exists in the set, false otherwise. */ public boolean exists(int i) { return list.contains(i); } public String toString() { char delimiter = \' \'; String str = \"[\"; for (Integer i : list) { str += i; str += delimiter; } return str + \"]\"; } /** * Finds the union of two sets. A null pointer is considered an empty set. * * Return \"new IntegerSet()\" when the result is an empty set. */ public static IntegerSet union(IntegerSet set1, IntegerSet set2) { IntegerSet union = new IntegerSet(); if (set1.isEmpty() && set2.isEmpty()) { return union; } if (!set1.list.isEmpty()) { for (Integer num : set1.list) { if (!union.list.contains(num)) { union.list.add(num); } } } if (!set2.isEmpty()) { for (Integer num : set2.list) { if (!union.list.contains(num)) { union.list.add(num); } } } return union; } /** * Finds the intersection of two sets. A null pointer is considered an empty * set. * * Return \"new IntegerSet()\" when the result is an empty set. */ public static IntegerSet intersection(IntegerSet set1, IntegerSet set2) { IntegerSet intersection = new IntegerSet(); // check for null pointers if (set1.list.isEmpty() || set2.list.isEmpty()) { return intersection; } for (Integer num : set1.list) { if ((!intersection.list.contains(num)) && set2.list.contains(num)) { intersection.list.add(num); } } return intersection; } /** * Builds an array with the ele.

I need help creating a parametized JUnit test case for the following.pdf

fonecomp

Sorting Questions (JAVA) See attached classes below. Attached Classes ------------------------------------------- Patient.java package A9.toStudents; public class Patient implements Comparable{ //attributes private int order; private String name; private boolean emergencyCase; //constructor public Patient(int order, String name, boolean emergencyCase) { this.order = order; this.name = name; this.emergencyCase = emergencyCase; } //compareTo public int compareTo(Patient other) { if(this.isEmergencyCase() && !other.isEmergencyCase()) return -1; //place this first else if(!this.isEmergencyCase() && other.isEmergencyCase()) return 1; //place other first else //if both are emergency or both are not emergency return this.getOrder()-other.getOrder(); //place smaller order first } //getters and setters public int getOrder() { return order; } public void setOrder(int order) { this.order = order; } public String getName() { return name; } public void setName(String name) { this.name = name; } public boolean isEmergencyCase() { return emergencyCase; } public void setEmergencyCase(boolean emergencyCase) { this.emergencyCase = emergencyCase; } public String toString() { return (isEmergencyCase()?\"*\":\"\") + name; } } -------------------------------------------------------- PatientComparator.java package A9.toStudents; import java.util.Comparator; public class PatientComparator implements Comparator{ public int compare(Patient p1, Patient p2) { if(p1.isEmergencyCase() && !p2.isEmergencyCase()) return -1; //place p1 first else if(!p1.isEmergencyCase() && p2.isEmergencyCase()) return 1; //place p2 first else //if both are emergency or both are not emergency return p1.getOrder()-p2.getOrder(); //place smaller order first } } --------------------------------- PatientTestQ12.java package A9.toStudents; import java.util.ArrayList; public class PatientTestQ12 { public static void main(String[] args) { ArrayList list = new ArrayList<>(5); list.add(new Patient(1, \"p1\", false)); list.add(new Patient(2, \"p2\", false)); list.add(new Patient(3, \"p3\", true)); list.add(new Patient(4, \"p4\", false)); list.add(new Patient(5, \"p5\", true)); //before sorting System.out.printf(\"%-15s%25s\ \", \"Before sorting\", list); //should be [p1, p2, p3, p4, p5] //try bubble sort methods for Q1 //Sorter.bubbleSort(list); //Sorter.bubbleSort(list, new PatientComparator()); //other sort methods for Q2 //Sorter.selectionSort(list); //Sorter.insertionSort(list); //after sorting System.out.printf(\"%-15s%25s\ \", \"After sorting\", list); //should be [p3, p5, p1, p2, p4] } } In this assignment, you will build a class that can be used to sort a list of patient using different algorithms, and you will also compare the time efficiency of these algorithms Download the following files from Connect to help you work on this assignment: Patient.java PatientComparator.java PatientTestQ12.java Q1. Create a class called Sorter that has two static methods: (10 marks) public static void bubbleSo.

Sorting Questions (JAVA)See attached classes below.Attached Clas.pdf

akritigallery

Class Diagram: In the Assignment #10, you are given three files Assignment10.java, LinkedList.java, and ListIterator.java. You will need to add additional methods in the LinkedList class in the LinkedList.java file. The LinkedList will be tested using strings only. Specifically, the following methods must be implemented in the LinkedList class: (You should utilize listIterator() method already defined in the LinkedList class to obtain its LinkedListIterator object, and use the methods in the LinkedListIterator class to traverse from the first element to the last element of the linked list to define the following methods.) 1. public String toString() The toString method should concatenate strings in the linked list, and return a string of the following format: { Apple Banana Melon Orange } Thus it starts with \"{\" and ends with \"}\", and there is a space between strings and \"{\" or \"}\". If the list is empty, it returns \"{ }\" with a space in between. 2. public boolean isEmpty() The isEmpty method returns true of the linked list is empty, false otherwise. 3. public void addElement(Object element) The addElement adds the parameter element at the parameter in the linked list in alphabetical order. For instance, if the linked list contains {Apple, Banana, Grape}, and a user tries to add \"Carrot\", then it should be added as: {Apple, Banana, Carrot, Grape}. 4. public Object removeElement(int index) The removeElement removes the string (Object) at the parameter index and returns it. Note that this index starts with 0 just like array indices. For instance, if the linked list contains {Apple, Banana, Carrot, Grape} and the parameter index is 3, then \"Grape\" should be remove. If the parameter index is larger or smaller than the existing indices, it should throw an object of the IndexOutOfBoundsException class (and the content of the linked list should remain unchanged). 5. public Object getElement(int index) The getElement searches the string (Object) at the parameter index and returns it. Note that this index starts with 0 just like array indices. For instance, if the linked list contains {Apple, Banana, Carrot, Grape} and the parameter index is 3, then \"Grape\" will be returned. If the parameter index is larger or smaller than the existing indices, it should throw an object of the IndexOutOfBoundsException class (and the content of the linked list should remain unchanged). 6. public void searchAndReplace(Object oldString, Object newString) The searchAndReplace method searches all occurrences of the first parameter string (object) in the list, and replaces them with the second parameter string (object). If the parameter string does not exist in the linked list, then the linked list content will not change. 7. public int indexOfLast(Object searchString) The indexOfLast searches the parameter string (object) with the largest index, and returns its index. If the parameter string does not exist in the linked list, then it should return -1. For i.

Class DiagramIn the Assignment #10, you are given three files Ass.pdf

xlynettalampleyxc

Please create the appropriate JUnit test cases to thoroughly unit test the following program: IntegerSet.java import java.util.*; public class IntegerSet{ private ArrayList<Integer> list= new ArrayList<>(); public IntegerSet(ArrayList list) { this.list=list; } // clears the all representation of class public void clear() { list.clear(); } // returns the length of set public int length() { return list.size(); } // return true if 2 lists are equal public boolean equals(IntegerSet b) { ArrayList<Integer> list2=b.list; if(list.size()!=list2.size()) { return false; } ArrayList<Integer> temp1=list; ArrayList<Integer> temp2=list2; Collections.sort(temp1); Collections.sort(temp2); for(int i=0;i<temp1.size();i++) { if(temp1.get(i)!=temp2.get(i)) { return false; } } return true; } // returns a largest item and throw exception if list is empty public int largest() throws IntegerSetException { if(list.size()==0) { IntegerSetException e= new IntegerSetException(); throw e; } int max=0; for(int i=0;i<list.size();i++) { if(list.get(i)>max) { max=list.get(i); } } return max; } // returns a largest item and throw exception if list is empty public int smallest() throws IntegerSetException { if(list.size()==0) { IntegerSetException e= new IntegerSetException(); throw e; } int min=Integer.MAX_VALUE; for(int i=0;i<list.size();i++) { if(list.get(i)<min) { min=list.get(i); } } return min; } // add item if already not exist in list public void addItem(int item ) { boolean exist=false; for(int i=0;i<list.size();i++) { if(list.get(i)==item) { exist=true; } } if(exist==false) { list.add(item); } } // remove item if already not exist in list public void removeItem(int item ) { for(int i=0;i<list.size();i++) { if(list.get(i)==item) { list.remove(i); } } } // return union of of 2 sets public IntegerSet union(IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); Set<Integer> set = new HashSet<>(); set.addAll(list); set.addAll(temp); ArrayList<Integer> list3= new ArrayList<>(set); IntegerSet list4= new IntegerSet(list3); return list4; } // return intersection of of 2 sets public IntegerSet intersection(IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); list.retainAll(temp); IntegerSet list4= new IntegerSet(list); return list4; } // returns difference of 2 sets public IntegerSet difference (IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); // Remove all elements in list2 from list list.removeAll(temp); IntegerSet list4= new IntegerSet(list); return list4; } public ArrayList<Integer> getlist(){ return list; } } IntegerSetException.java class IntegerSetException extends Exception { Driver.java import java.util.*; public class Driver { public static void main(String[] args) throws IntegerSetException { ArrayList<Integer> list1= new ArrayList<>(); ArrayList<Integer> list2= new ArrayList<>(); // make 2 instance of integerset class for implementation IntegerSet set1= new IntegerSet(list1); IntegerSet set2= new IntegerSet(list2); set1.addItem(1); set1.ad.

Please create the appropriate JUnit test cases to thoroughly.pdf

kitty811

import static org.junit.Assert.;import java.util.Arrays; import.pdf

sudheerforce

Java10 Collections and Information

SoftNutx

Similar to (Sort ArrayList) Write the following method that sorts an ArrayList.pdf (20)

Below is a given ArrayList class and Main class Your Dreams Our Mission/tuto...

In Java code, implement the HeapSort algorithm. Your function must t.pdf

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

Java Generics

Array list

Please help me to make a programming project I have to sue them today- (1).pdf

Collection and framework

Implement the ListArray ADT-Implement the following operations.pdf

Write a java class LIST that outputsmainpublic class Ass.pdf

Hi,I have added the methods and main class as per your requirement.pdf

Array list (java platform se 8 )

Selection sort

ReversePoem.java ---------------------------------- public cl.pdf

you will implement some sorting algorithms for arrays and linked lis.pdf

I need help creating a parametized JUnit test case for the following.pdf

Sorting Questions (JAVA)See attached classes below.Attached Clas.pdf

Class DiagramIn the Assignment #10, you are given three files Ass.pdf

Please create the appropriate JUnit test cases to thoroughly.pdf

import static org.junit.Assert.;import java.util.Arrays; import.pdf

Java10 Collections and Information

More from alokkesh

most extra cellular environments contain a high concentration of sodium ions (Na+). consider a cell membrane that is permeable to potassium (K+) and is in equilibrium. the diffusion of K+ has left the inside of the ell slightly negatively charged and the outside slightly positively charged. suppose that the cell membrane now opens some sodium channels what happens? A) there is no flow across the membrane. the outside of the cell is positeely charged drivingthe sodium ions father away from the cell. B) there is no flow across the membrane. the cell is in equilibrim and so the electric repulsionof the Na+ exactly counters the effects of diffusion. C) the cell becomes positvely charged. both diffusion and the electric attraction to the cell drive into the cell D) the cell becomes positvely charged; diffusion is reversed and K+ are drived back into the cell Solution The cell becomes positively charged, diffusion is reversed and K+ are drived back into the cell..

most extra cellular environments contain a high concentration of sod.pdf

(Sort ArrayList) Write the following method that sorts an ArrayList.pdf

Recommended

Recommended

More Related Content

Similar to (Sort ArrayList) Write the following method that sorts an ArrayList.pdf

Similar to (Sort ArrayList) Write the following method that sorts an ArrayList.pdf (20)

More from alokkesh

More from alokkesh (20)

Recently uploaded

Recently uploaded (20)

(Sort ArrayList) Write the following method that sorts an ArrayList.pdf