Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Textbook Question
Chapter 26.5, Problem 26.5.1CP
Use Listing 26.2 as a template to describe the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Write a recursive function that finds the minimum value in an ArrayList.
Your function signature should be
public static int findMinimum(ArrayList<Integer>)
One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”.
For example, if you have the ArrayList
[1, 3, 2, 567, 23, 45, 9],
the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45]
Hint:The trick is to remove the last element each time to make the ArrayList a little shorter.
import java.util.*;
public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}}
int minimum =…
The following are the different operations that can be done using a doubly linked list. The corresponding algorithm and simulation/s are attached in the course material for doubly linked list. Choose only one operation and create the Java program for the chosen operation using its corresponding algorithm. The rubric below will be used to assess your output.
Insertion in the beginning of the list
Insertion after a node
Insertion before a node
Deletion of the first node
Deletion of the last node
Deletion of a given node
Write a recursive function that finds the minimum value in an ArrayList.
Your function signature should be
public static int findMinimum(ArrayList<Integer>)
One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”.
For example, if you have the ArrayList
[1, 3, 2, 567, 23, 45, 9],
the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45]
================================================
import java.util.*;
public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}}
int minimum = findMinimum(numbers);System.out.println("Minimum: " + minimum);}public static int…
Chapter 26 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 26.2 - Prob. 26.2.1CPCh. 26.2 - Prob. 26.2.2CPCh. 26.2 - Prob. 26.2.3CPCh. 26.3 - Prob. 26.3.1CPCh. 26.3 - Prob. 26.3.2CPCh. 26.3 - Prob. 26.3.3CPCh. 26.4 - Prob. 26.4.1CPCh. 26.4 - Prob. 26.4.2CPCh. 26.4 - Prob. 26.4.3CPCh. 26.4 - Prob. 26.4.4CP
Ch. 26.5 - Use Listing 26.2 as a template to describe the...Ch. 26.6 - Prob. 26.6.1CPCh. 26.6 - Prob. 26.6.2CPCh. 26.6 - Prob. 26.6.3CPCh. 26.6 - Prob. 26.6.4CPCh. 26.7 - Prob. 26.7.1CPCh. 26.7 - Prob. 26.7.2CPCh. 26.7 - Prob. 26.7.3CPCh. 26.7 - Prob. 26.7.4CPCh. 26.8 - Prob. 26.8.1CPCh. 26.8 - Prob. 26.8.2CPCh. 26.8 - Prob. 26.8.3CPCh. 26.9 - Prob. 26.9.1CPCh. 26.9 - Prob. 26.9.2CPCh. 26.9 - Prob. 26.9.3CPCh. 26 - Prob. 26.5PE
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Practice Problem 4.9 (solution page 484) Write an HCL expression for a signal xor, equal to the EXCLUSIVE-OR of...
Computer Systems: A Programmer's Perspective (3rd Edition)
Implement a method, empty, that simulates the effect of removing all money from the machine. This method should...
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
What is the average Read score for all students? What are the minimum and maximum Read scores?
Modern Database Management
What is direct recursion? What is indirect recursion?
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
A tumor may be regarded as a population of multiplying cells. It is found empirically that the birth rate of th...
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
The Python built-in function str () will convert a numerical argument into a character string representation, a...
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a java method to search for an element in an array using a linear search. Many list processing tasks, including searching, can be done recursively. The base case typically involves doing something with a limited number of elements in the list (say the first element), then the recursive step involves doing the task on the rest of the list. Think about how linear search can be viewed recursively; if you are looking for an item in a list starting at index i:o ¬If i exceeds the last index in the list, the item is not found (return -1).o ¬If the item is at list[i], return i.o ¬If the is not at list[i], do a linear search starting at index i+1arrow_forwardImplement a recursive function void deleteMax() on the IntList class (provided). The function will delete from the IntList the IntNode containing the largest value. If there are multiple nodes containing this largest value, only delete the 1st one. Be careful not to cause any memory leaks or dangling pointers. You may NOT use any kind of loop (must use recursion). You may NOT use global or static variables. You may NOT use any standard library functions. Ex: list: 5->7->1->16->4->16->3 list.deleteMax(); list: 5->7->1->4->16->3 IntList.h #ifndef __INTLIST_H__#define __INTLIST_H__ #include <ostream> using namespace std; struct IntNode {int value;IntNode *next;IntNode(int value) : value(value), next(nullptr) {}}; class IntList { private:IntNode *head; public: /* Initializes an empty list.*/IntList() : head(nullptr) {} /* Inserts a data value to the front of the list.*/void push_front(int val) {if (!head) {head = new IntNode(val);} else {IntNode…arrow_forwardCorrect answer will be upvoted else downvoted. Computer science. section grouping is a string containing just characters "(" and ")". A standard section succession is a section grouping that can be changed into a right number juggling articulation by embedding characters "1" and "+" between the first characters of the arrangement. For instance, section successions "()()" and "(())" are normal (the subsequent articulations are: "(1)+(1)" and "((1+1)+1)"), and ")(", "(" and ")" are not. You need to find a string b that comprises of n characters to such an extent that: b is a standard section grouping; in the event that for some I and j (1≤i,j≤n) ai=aj, bi=bj. As such, you need to supplant all events of 'A' with a similar kind of section, then, at that point, all events of 'B' with a similar sort of section and all events of 'C' with a similar sort of section. Your undertaking is to decide whether such a string b exists. Input The primary line contains a solitary…arrow_forward
- In Java: Modify the attached program code below According to the question a, b and c a. Replace the appendNode() method by an insertNode() method which inserts the new node in such a way to keep the list always sorted in increasing order. b. Add a recursive method displayReverse() which displays the list in reverse order. c. Do the needed changes to the main()in order to reflect the above two changes. public class DoublyLinkedList { private Node head;private Node tail;private int size; DoublyLinkedList() {tail = head = null;size = 0;} public void addNode(String item) {//adding a node at the endNode newNode = new Node(item);if(head == null) {head = tail = newNode;}else {newNode.prev = tail;tail.next = newNode;tail = newNode;}size++;} public boolean remove(String item) {Node current = head;boolean found = false;while((current != null)&&(!found)) {if(current.element.equals(item))found = true;elsecurrent = current.next;}if(found){if(current == head) head =…arrow_forwardJava (Sort, IComparable) The librarian wants to sort the media in the ArrayList by title. For this purpose, the Medium class should implement the Comparable interface. Implement a Method compareTo (...) in the abstract class Medium. Then sort the Media in the ArrayList. Implement the sort method in the Zettelkasten class.This should, by Parameters can be selected, the media contained in descending ("A" → "Z") or ascending ("Z" → Sort "A") by title. Please do not implement your own sorting algorithm, but rather simply use a suitable method of the ArrayList class. Increase the efficiency of the note box. The note box should remember whether the The media contained therein are already sorted, e.g. by calling sort earlier. In this case, re-sorting should be omitted.arrow_forwardimplement QuickSort of ints that sorts the numbers in the non-decreasing order and in c language Implement the rearrange function used for QuickSort using the O(n) time algorithm with two pointers. The function gets as input an array, and index of the pivot. The function rearranges the array, and returns the index of the pivot after the rearrangement. please write form as: int rearrange(int* A, int n, int pivot_index); 2, Implement the QuickSort algorithm. For n<=2 the algorithm just sorts the (small) array (smaller number first). - For n>=3 the algorithm uses the rearrange function with the pivot chosen to be the median of A[0], A[n/2], A[n-1]. write as form: void quick_sort(int* A, int n);arrow_forward
- Implement a program that implements a sorted list using dynamic allocated arrays. Use C++ and do not use Standard Library Template. (Implement the steps in each bullet point and show correct output) New solution with steps! DataFile.txt contains the information of poker cards. C: clubs(lowest),D: diamonds, H: hearts, S:spades(highest) 2 (lowest), 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A No Joker cards Any C cards are lower than any D cards. DataFile Content(You can write the file specification into your program.): H4,C8,HJ,C9,D10,D5,DK,D2,S7,DJ,H3,H6,S10,HK,DQ,C2,CJ,C4,CQ,D8,C3,SA,S2,HQ,S8,C6,D9,S3,SQ,C5,S4,H5,SJ,D3,H8,CK,S6,D7,S9,H2,CA,C7,H7,DA,D4,H9,D6,HA,H10,S5,C10 H4, D5, HK, D2 H4, HK, SK C9,C10 For examples, DJ means J of Diamonds;H7 means 7 of hearts. Take into account each bullet point for output! Create a list by dynamic allocated array and set the size to 20 Read the first 20 cards in the first line of the file, the put them one by one into the list by implementing…arrow_forwardPlease help with the following in JAVA Given an integer list nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array.arrow_forwardCan I get an example of using the invert colors function on python? the code starting with def invert_colors(image_matrix):arrow_forward
- Using java language In voltTest[10] is an encapsulated array that contains 10 voltages. Display how many are ACTIVE (5V), SATURATED (greater than 5V) and CUTOFF (less than 5V). Use the UML diagram as a reference. setValue(int,int,int) – accepts the value of voltActive, voltSaturated and voltCutoff as a parameter, which is the number of active, saturated and cutoff voltages. displayResult() – displays the number of active, saturated and cutoff voltages.arrow_forwardSolution in Java Create a function that takes an array of increasing letters and return the missing letter. Examples missing Letter (["a", "b", "c", "e", "f", "g"]) → "d" missing Letter (["O", "Q", "R", "S"]) → "P"arrow_forwardI need following code in java Sorting with Lists In this exercise, we want to realize list versions of sorting algorithms that we know already for arrays. 1. Develop a version of Insertion Sort for linked lists. Realize it as a method void insertionsort() that turns the current list into a sorted list. Hint: The idea of Insertion Sort is to repeatedly insert nodes into a sorted list such that the order is preserved. Check out which of the methods defined for your linked list type contain ideas that can be used for implementing insertionsort. 2. Develop a version of Quicksort for head-tail lists. Realize it as a method void quicksort() that turns the current list into a sorted list. Hint: The idea of Quicksort is to repeatedly choose an element of the cur- rent list as pivot and to partition the current list into two lists, one with elements less or equal than the pivot value and another one with elements greater or equal than the pivot value. Then, the two new lists are each sorted…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License