Design and implement an insertSorted() method for the MyArrayList class. The method should receive a single object and insert it in its correct position. You can assume that the calling array is already in a sorted order. The calling array is therefore updated.Follow the three step method for designing the method.Develop the java code for the method.Create a test program to test the method thoroughly using the Integer wrapper class. PMyarraylistcE> returnarray - new HyArraylist();if (this.getsize() --a) // sane as if (sizes-0)return paran;if (paran. getsize()a0)return this;if ((this.getsize()+ param. getsize()) > HAXELEHENTS)throw new IndexoutofBoundsException("Combined list out of bounds");Il traverse both list until one list is completely doneuhile (icthis.getsize() jeparam.getsize())I/ Compare single value from each list and copy smallest into resultif (((Comparable)data[i]).compareTo(param.deta(j]) <0)returnarray.data(k)- this.data(i];elsereturnarray.data[k]=paran.data[j];returnarray.size k; // set size of return arrayreturn returnarray;public String tostring() {String resulte"(";for (int i - 0; i « size; i++) {resultte data(i];if (4 « size - i) resulte", ";return result. tostring() + "1":public int getsize() {return size;public boolean sortiist() {E hold;for (int i- e; 1 < size-1; i+t)for (int j- 0; jesize-1; j++)iFccComparable)data( ]). compareTo(data[j+1])>0)holde datalj+1];data(j+1]=data[j]:data(i]-hold;return true; public class MyArrayListprivate int size; // Number of elenents in the listprivate E[] data;private int MAXELEMENTS- 100;j** Create an empty list */public MyarrayList() {data - (E[])new Object[MAXELENENTS];// cannot create array of genericssize - 0; // Number of elements in the listpublic void add(int index, E e) {// Ensure the index is in the right rangeif (index size)throw new IndexOutofBoundsException("Index: "+ index + ", Size: + size);// Move the elements to the right after the specified indexfor (int i- size - 1; i >- index; 1--)data[i + 1] - data[i];// Insert new element to data[index]data[index] - e;// Increase size by 1size+t;public boolean contains (Object e) {for (int i - o, i< size; i++)if (e.equals (data[i])) return true;return false;public E get(int index) (if (index < e || index >- size)throu new IndexOutofBoundsException("Index: " + index + ", Size: + size);return data[index];public E remove(int index) {if (index - size)throu new IndexOutofBoundsException("Index: " + index + ", Size: + size);Ee- data[index];// Shift data to the leftfor (int j - index; 1< size - 1; 1+)data[j] - data[j + 1]:data[size - 1] - null; // This element is now null// Decrement sizesize--;return e;public void clear()size - 0;public MyArrayList merge(yArrayListcE> paran)int 1-0; //counter in calling arrayint jue; // counter in paran arrayint k-9; // sounter in return array

public class MyArrayList<E> { private int size; private E[] data;…

Design and implement an insertSorted() method for the MyArrayList class. The method should receive a single object and insert it in its correct position. You can assume that the calling array is already in a sorted order. The calling array is therefore updated. Follow the three step method for designing the method. Develop the java code for the method. Create a test program to test the method thoroughly using the Integer wrapper class.

Design and implement an insertSorted() method for the MyArrayList class. The method should receive a single object and insert it in its correct position. You can assume that the calling array is already in a sorted order. The calling array is therefore updated. Follow the three step method for designing the method. Develop the java code for the method. Create a test program to test the method thoroughly using the Integer wrapper class.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screen In the same program, replace the element in the ArrayList at index 2 by null. Print the resulting list tothe screen.
class MyList: # constructor def __init__(self, a): # converting array to list newList = a.tolist() # printing the list print("List is:", newList). Complete.
Duplicate Set This function will receive a list of elements with duplicate elements. It should add all of the duplicate elements to a set and return the set containing the duplicate elements. A duplicate element is an element found more than one time in the specified list. The order of the set does not matter. Signature: public static HashSet<Object> duplicateSet(ArrayList<Object> list) Example: INPUT: [2, 4, 5, 3, 3, 5] OUTPUT: {5, 3}
// pre: list != null, list.length > 0        // post: return index of minimum element of array        public static int findMin(int[] list)        {   assert list != null && list.length > 0 : "failed precondition";            int indexOfMin = 0;            for(int i = 1; i < list.length; i++)            {   if(list[i] < list[indexOfMin])                {   indexOfMin = i;                }            }            return indexOfMin;        } draw DFG, find the all-def/c/p use paths. then write junit test to test the paths for all-def/c/p use for findMin()
// pre: list != null, list.length > 0       // post: return index of minimum element of array        public static int findMin(int[] list)       {   assert list != null && list.length > 0 : "failed precondition";           int indexOfMin = 0;           for(int i = 1; i < list.length; i++)           {   if(list[i] < list[indexOfMin])               {   indexOfMin = i;               }           }           return indexOfMin;       } Question: draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)
public class ShoppingListDriver{ public static void main(String[] args){  ShoppingList sl=new ShoppingList(3);sl.insert(null);sl.insert(new Item("Bread", "Carb Food", 2, 2.99));sl.insert(new Item("Seafood","Sea Food", -1, 10.99));sl.insert(new Item("Rice", "Carb Food",2, 19.99));sl.insert(new Item("Salad Dressings","Dessing", 2, 19.99));sl.insert(new Item("Eggs", "Protein",2, 3.99));sl.insert(new Item("Cheese","Protein", 2, 1.59));sl.insert(new Item("Eggs", "Protein",3, 3.99));sl.printNames();sl.print();  System.out.println("After removing Eggs:");sl.remove(new Item("Eggs","Protein",0,0));sl.printNames();sl.print();  }}
private static final List<Polynomial> polyList = new ArrayList<>(); //main here public static void main(String[] args) { processPolyList(); } //=============================================================================================== // method: fromFile / returns: Arraylist // description: Opens a file takes a String and tokenizes it into an ArrayList of of expressions //=============================================================================================== public static ArrayList<String> f
Question 2: Linked List Implementation You are going to create and implement a new Linked List class. The Java Class name is "StringLinkedList". The Linked List class only stores 'string' data type. You should not change the name of your Java Class. Your program has to implement the following methods for the StringLinked List Class: 1. push(String e) - adds a string to the beginning of the list (discussed in class) 2. printList() prints the linked list starting from the head (discussed in class) 3. deleteAfter(String e) - deletes the string present after the given string input 'e'. 4. updateToLower() - changes the stored string values in the list to lowercase. 5. concatStr(int p1, int p2) - Retrieves the two strings at given node positions p1 and p2. The retrieved strings are joined as a single string. This new string is then pushed to the list using push() method.
6. Suppose that we have defined a singly linked list class that contains a list of unique integers in ascending order. Create a method that merges the integers into a new list. Note the additional requirements listed below. Notes: ● . Neither this list nor other list should change. The input lists will contain id's in sorted order. However, they may contain duplicate values. For example, other list might contain id's . You should not create duplicate id's in the list. Important: this list may contain duplicate id's, and other list may also contain duplicate id's. You must ensure that the resulting list does not contain duplicates, even if the input lists do contain duplicates.
Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screen Create a class named ArrayListManager. Into this class, code a method which prints to the screenevery element of an Array List of strings placed at an odd index. Hint: use a modulus.
Refactore UIMenuBuilder/UIFormBuilder to remove redundant and copied code. public final class UIFormBuilder {private final List<Pair> _menu = new ArrayList<Pair>();public void add(String prompt, UIFormTest test) {_menu.add(new Pair<String, UIFormTest>(prompt, test));}public UIForm toUIForm(String heading) {if (null == heading)throw new IllegalArgumentException();if (_menu.size() < 1)throw new IllegalStateException();Pair[] array = new Pair[_menu.size()];for (int i = 0; i < _menu.size(); i++)array[i] = _menu.get(i);return new UIForm(heading, array);}} public class UIMenuBuilder { private final List<Pair<String,UIMenuAction>> _menu; public UIMenuBuilder() { _menu = new ArrayList<Pair<String,UIMenuAction>>(); } public UIMenu toUIMenu(String heading) { if (null == heading) throw new IllegalArgumentException(); if (_menu.size() <= 1) throw new IllegalStateException();…
Java/Data Structures: The public ArrayList() constructor in the Java Class Library ArrayList creates an empty list with an initial capacity of ____. Multiple choice. A) 0 B) 1 C) 10 D) 100