Question 1 Consider the following Java program. Given an ArrayList a that stores the data items: 27, 18, 9, 37, 21, 25, 4. public class Treesort { ArrayList avlsort (ArrayList a) { AVLTree t = new AVLTree<> (); for (int i = 0; i < a.size (); i++) t.add (a. get (i)); ArrayList ans = t.inOrder (); for (int i = 0; i < ans.size (); i++) System.out.print (ans.get (i) + ", "); // line (a) System.out.println (); return ans; (a) What is the output at line(a)? (b) What is the runtime of the method aviSort in big-O notation if the input ArrayList stores n data items?

Question 1 Consider the following Java program. Given an ArrayList a that stores the data items: 27, 18, 9, 37, 21, 25, 4. public class Treesort { ArrayList avlsort (ArrayList a) { AVLTree t = new AVLTree<> (); for (int i = 0; i < a.size (); i++) t.add (a. get (i)); ArrayList ans = t.inOrder (); for (int i = 0; i < ans.size (); i++) System.out.print (ans.get (i) + ", "); // line (a) System.out.println (); return ans; (a) What is the output at line(a)? (b) What is the runtime of the method aviSort in big-O notation if the input ArrayList stores n data items?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

In java A supermarket wants to reward its best customer of each day, showing the customer’s name on a screen in the supermarket. For that purpose, the store keeps an ArrayList.Create a class customer having id, name, gender, and bill provide appropriate getters/setters and constructors also provide toString method.In the Store class, make an ArrayList of customers, store name, and address implement methods public void addSale(Customer c) that will add customers to the arraylist.public void RemoveCustomer(int id);public void UpdateCustomerRecord(int Id);public displayAll();public String nameOfBestCustomer() to record the sale and return the name of the customer with the largest sale. public ArrayList nameOfBestCustomers(int topN) so that it displays the top customers, that is, the topN customers with the largest sales, where topN is a value that the user of the program supplies. Write a program that prompts following menu and ============================================…
We were given the following code to solve a Pentomino puzzle, several methods might need to be added or editted to solve the problem. The program should take in an input of 3 4 5 6 for 3x20 4x15 5x12 6x10 grids. Then output the number of correct solutions for them (respectively its 2, 368, 1010, and 2339) import java.util.ArrayList;import java.util.LinkedList;import java.util.List; public class DLX { class DataNode { DataNode L, R, U, D; ColumnNode C; public DataNode() { L = R = U = D = this; } public DataNode(ColumnNode c) { this(); C = c; } DataNode linkDown(DataNode node) { node.D = this.D; node.D.U = node; node.U = this; this.D = node; return node; } DataNode linkRight(DataNode node) { node.R = this.R; node.R.L = node; node.L = this; this.R = node; return node;…
In Java: Given two Arrays of equal length(arrayA & arrayB), for every element in arrayA, add the coresponding element from arrayB that are in the same index. Example: arrayA = {1, 2, 3, 4} arrayB = {2, 4, 6, 8} Output result of the state of arrayA: arrayA = {3, 6, 9, 12}
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. import java.util.ArrayList;public class EvenAfterOdds{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
JAVA: Consider the following ArrayList: ArrayList myList = new ArrayList<Insect>() Using polymorphism, what type of objects could you put into this ArrayList? (Select all that apply) Group of answer choices: A: StagBeetle B: Ant C: Beetle D: AntColony
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. public ArrayList<Integer> solution(ArrayList<Integer> nums) {ArrayList<Integer> finalList = new ArrayList<>();int index = 0;for (int i = 0; i < nums.size(); i++) {if (nums.get(i) % 2 == 1) {finalList.add(index, nums.get(i));index++;} elsefinalList.add(nums.get(i));}return finalList;} This is my failing code. for [1.-3.3] where [1,3,-3] is being returned
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
This is a java question Given an efficient circular bent array-based queue q capable of holding 7 objects. Show the final contents of the array after the following code is executed: for (int k = 1; k <= 6; k++) q.enqueue(k);for (int k = 1; k <= 3; k++) { q.dequeue( ); q.enqueue(q.dequeue( )); } 0 1 2 3 4 5 6
Given an ArrayList of Integers, find a subarray with the maximum sum of any potential subarray within the ArrayList. A subarray is any combination of consecutive numbers. The subarray can be of any length n, where the size of n >= 0. import java.util.ArrayList;public class MaxSubArray{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
Consider class IntArrayStack that has two instance variables: int[] data and int top. Implement an instance method inside the IntArrayStack, called popBottom(),that extracts and returns as output the element at the bottom of the stack. All other elements in the stack must remain unchanged and in the same order.
In java .If arraylist contain "apple", "orange", "mango", "grapes". What indexOf("melon") do
Create an arraylist in Java of 10 students. Use the following methods: add, remove, insert, size, capacity, contains ,and clear