Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 16.3, Problem 16.15CP
Let a[ ] and b[ ] be two integer arrays of size n. Following the examples of this section, give a formal description of the problem of determining if every element of a[ ] is also an element of b[ ]. The output of the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The following program generates all permutations of the numbers 0, 1, 2, ... , n – 1, without using recursion.
The algorithm uses the fact that the set to be permuted consists of distinct numbers. Thus, you cannot use the same algorithm to compute the permutations of the characters in a string. You can, however, use this technique to get all permutations of the character positions and then compute a string whose ith character is s[a[i]]. Use this approach to reimplement the generate_permutations function without recursion. c++
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list.
In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes.
Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time.
Then as you test a value, print out the results, either too high, too low, or a match.
Sample Output
Starting value: 0
Ending value: 9
Testing midpoint value: 4 Too high!
Starting value: 0
Ending value: 3
Testing midpoint value: 1 Too low!
Starting value: 2
Ending value: 3
Testing midpoint value: 2 Match!
public class BinaryExplorer {
public static void main(String[] args) {int[] testArray = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
binaryRec(testArray, 8, 0, testArray.length - 1);
}
/*** Add Print statements to the binaryRec method:* * Print Starting, ending, and midpoint values.* * Print when you find a match* * Print if you are…
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list.
In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes.
Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time.
Then as you test a value, print out the results, either too high, too low, or a match.
Sample Output
Starting value: 0 Ending value: 9 Testing midpoint value: 4 Too high! Starting value: 0 Ending value: 3 Testing midpoint value: 1 Too low! Starting value: 2 Ending value: 3 Testing midpoint value: 2 Match!
Chapter 16 Solutions
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Ch. 16.1 - Prob. 16.1CPCh. 16.1 - Prob. 16.2CPCh. 16.1 - Prob. 16.3CPCh. 16.1 - Prob. 16.4CPCh. 16.2 - Prob. 16.5CPCh. 16.2 - Prob. 16.6CPCh. 16.2 - Prob. 16.7CPCh. 16.2 - If a sequential search is performed on an array,...Ch. 16.3 - Prob. 16.9CPCh. 16.3 - Prob. 16.10CP
Ch. 16.3 - Prob. 16.11CPCh. 16.3 - Prob. 16.12CPCh. 16.3 - Prob. 16.13CPCh. 16.3 - Prob. 16.14CPCh. 16.3 - Let a[ ] and b[ ] be two integer arrays of size n....Ch. 16.3 - Prob. 16.16CPCh. 16.3 - Prob. 16.17CPCh. 16.3 - Prob. 16.18CPCh. 16 - Prob. 1MCCh. 16 - Prob. 2MCCh. 16 - Prob. 3MCCh. 16 - Prob. 4MCCh. 16 - Prob. 5MCCh. 16 - Prob. 6MCCh. 16 - Prob. 7MCCh. 16 - Prob. 8MCCh. 16 - Prob. 9MCCh. 16 - Prob. 10MCCh. 16 - True or False: If data is sorted in ascending...Ch. 16 - True or False: If data is sorted in descending...Ch. 16 - Prob. 13TFCh. 16 - Prob. 14TFCh. 16 - Assume this code is using the IntBinarySearcher...Ch. 16 - Prob. 1AWCh. 16 - Prob. 1SACh. 16 - Prob. 2SACh. 16 - Prob. 3SACh. 16 - Prob. 4SACh. 16 - Prob. 5SACh. 16 - Prob. 6SACh. 16 - Prob. 7SACh. 16 - Prob. 8SACh. 16 - Prob. 1PCCh. 16 - Sorting Objects with the Quicksort Algorithm The...Ch. 16 - Prob. 3PCCh. 16 - Charge Account Validation Create a class with a...Ch. 16 - Charge Account Validation Modification Modify the...Ch. 16 - Search Benchmarks Write an application that has an...Ch. 16 - Prob. 8PCCh. 16 - Efficient Computation of Fibonacci Numbers Modify...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
This is an example of a data type conversion function in pseudocode. a. sqrt b. toReal c. substring d. isNumeri...
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
The following table gives the parameters for a number of different caches. For each cache, fill in the missing ...
Computer Systems: A Programmer's Perspective (3rd Edition)
John travels a distance of 55 miles at an average speed of 15 miles per hour. Write a program to calculate the ...
Absolute Java (6th Edition)
Compute the weakest precondition for each of the following assignment statements and postconditions: a. a = 2 ...
Concepts of Programming Languages (11th Edition)
In this chapter we have mentioned the data types int and String. Java has more predefined data types. Find out ...
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
It is not possible to call a superclasss _ _init_ _ method from a subclasss _ _init_ _ method.
Starting Out with Python (4th Edition)
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
- Given a string str and number n, write a program that recursively appends a copy of string str n times and returns the resulting string. For example: RecuriveCopy("a", 10) // -> "aaaaaaaaaaa" RecursiveCopy("blah", 5) // -> "blahblahblahblahblahblah" For this exercise, complete the following function. n is the number of copies to add to str: function RecursiveCopy(str, n) { // your code here } Part 2: Call RecursiveCopy Write another function that calls RecursiveCopy() and returns the following string output: "The resulting string [x] has [y] characters". [x] should be replaced by the result from RecursiveCopy) and [y] should be replaced by the number of characters in the resulting string. You may pick the arguments to RecursiveCopy in CountChars or have the user provide input. I will leave this up to you. function CountChars() { } // your code here // call RecursiveCopy(..) // returns a formatted string For example: console.log(CountChars()) // -> "The resulting string blahblahblahblah…arrow_forwardThe problem:➢ Input: a string in a line.➢ Output: Print the pattern and the repeated count if there is a repeated pattern, Print "none"otherwise.➢ Task: Design an algorithm in pseudocode/code to for the problem and write down theAlgorithm analysis. The complexity of the algorithm must be in O(n).arrow_forwardThe Fibonacci algorithm is a famous mathematical function that allows us to create a sequence of numbers by adding together the two previous values. For example, we have the sequence:1, 1, 2, 3, 5, 8, 13, 21…Write your own recursive code to calculate the nth term in the sequence. You should accept a positive integer as an input, and output the nth term of the sequence.Once you have created your code, add comments describing how the code works, and the complexity of any code you have created.arrow_forward
- The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid’s algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner: Compute the remainder of dividing the larger number by the smaller number. Replace the larger number with the smaller number and the smaller number with the remainder. Repeat this process until the smaller number is zero. The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD. An example of the program input and output is shown below: Enter the smaller number: 5 Enter the larger number: 15 The greatest common divisor is 5arrow_forwardIn computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms – the amount of time, storage, or other resources needed to execute them. Discuss the algorithm for recursion method that takes in a string and returns a reversed copy of the string and also Write a Program using the same algorithm for recursion method. The only inbuilt string function you are allowed to use is string concatenation. Ex. Input text = "Pyhton", Output > "nothyP"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
- Using Matlab. Monte Carlo methods are a class of computational methods that rely on repeated random sampling to compute their results. In this problem, you will use the Monte Carlo method to estimate the temperature at an arbitrary point in a uniform solid. Specifically, we will consider the solid object shown below. The temperatures of all surfaces are 500 des F with the exception of the two shaded surfaces, which are at 0 deg F. Inputs to the program should be: 1. The number of random walkers. 2. The (x,,2) coordinates of the point at which the temperature is to be estimated. 3. Plot interval (eg., you may want 1,000,000 random walkers in the simulation but may want to plot after every 10,000). Output from the program should be: 1. A graph of the estimated temperature, plotted according to the plot interval 2. Numerical value of the estimated temperature. USING MATLABarrow_forwardThe Fibonacci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. The first few terms are: 0, 1, 1, 2, 3, 5, 8, 13, 21, ... Write an algorithm in pseudo code to generate and print the first N terms of the Fibonacci series where N is user-defined. Pay attention to how your algorithm prints the first two terms.arrow_forward5. Given # > 3 points P₁ = (x₁, y₁), …….‚ P₂ = (x₂‹ Yn) in the coordinate plane, design an algorithm to check whether all the points lie within a triangle with its vertices at three of the points given. (You can either design an algorithm from scratch or reduce the problem to another one with a known algorithm.)arrow_forward
- Given a string s that is input as a character array,explain how to (i) reverse the string and (ii) check if it is a palindrome. A palindrome is a string that reads the same forward and backward, for example, “MADAM”arrow_forwardEuclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes thegreatest common divisor, denoted by gcd, of two integers. Below are the original versions ofEuclid’s algorithm that uses repeated subtraction and another one that uses the remainder.int gcd_sub(int a, int b){ if (!a) return b; while (b) if (a > b) a = a – b; else b = b – a; return a;}int gcd_rem(int a, int b){ int t; while (b) { t = b; b = a % b; a = t; } return a;}1. Trace each of the above algorithm using specific values for a and b.2. Compare both algorithms.arrow_forwardConsider the given alorithm where A(1:n) is an array of n integers... A) What does the program do? What are the interpretations of B and C? B) What is the EXACT number comparisons in the best case in terms of n? C) What is the EXACT number comparisons in the worst case in terms of n?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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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