Java: An Introduction to Problem Solving and Programming (8th Edition)
8th Edition
ISBN: 9780134462035
Author: Walter Savitch
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 11.2, Problem 14STQ
If a value in an array of base type int occurs twice—for example, both b[0] and b[5] are 7—and you sort the array by using the method MergeSort.sort, will there be one or two copies of the repeated value after the array is sorted?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array)
given an array of integer values , return true if 6 appears as
either the first or last element in the array.
firstLast6([1,2,36]) true
firstLast([6,1,2,3]) true
firstLast([13,6,1,2,3]) false
In the "Common Array Algorithms" section, you learned how to find the position of an element in an array. Suppose you want to find the position of the second match. You could remove the first match and start over, but that would be wasteful. Instead, adapt the algorithm from that section so that it starts the search at a given position, not zero. Complete the following code.
Chapter 11 Solutions
Java: An Introduction to Problem Solving and Programming (8th Edition)
Ch. 11.1 - What output will be produced by the following...Ch. 11.1 - What is the output produced by the following code?Ch. 11.1 - Write a recursive definition for the following...Ch. 11.1 - What is the output of the following code? public...Ch. 11.1 - Prob. 5STQCh. 11.1 - Complete the definition of the following method....Ch. 11.2 - Revise the method getCount in Listing 11.5 so that...Ch. 11.2 - Prob. 8STQCh. 11.2 - Prob. 9STQCh. 11.2 - Suppose you want me class ArraySearcher to work...
Ch. 11.2 - What Java statement will sort the following array,...Ch. 11.2 - How would you change the class MergeSort so that...Ch. 11.2 - How would you change the class MergeSort so that...Ch. 11.2 - If a value in an array of base type int occurs...Ch. 11.3 - Convert the following event handler to use the...Ch. 11 - What output will be produced by the following...Ch. 11 - What output will be produced by the following...Ch. 11 - Write a recursive method that will compute the...Ch. 11 - Write a recursive method that will compute the sum...Ch. 11 - Complete a recursive definition of the following...Ch. 11 - Write a recursive method that will compute the sum...Ch. 11 - Write a recursive method that will find and return...Ch. 11 - Prob. 8ECh. 11 - Write a recursive method that will compute...Ch. 11 - Suppose we want to compute the amount of money in...Ch. 11 - Prob. 11ECh. 11 - Write a recursive method that will count the...Ch. 11 - Write a recursive method that will remove all the...Ch. 11 - Write a recursive method that will duplicate each...Ch. 11 - Write a recursive method that will reverse the...Ch. 11 - Write a static recursive method that returns the...Ch. 11 - Write a static recursive method that returns the...Ch. 11 - One of the most common examples of recursion is an...Ch. 11 - A common example of a recursive formula is one to...Ch. 11 - A palindrome is a string that reads the same...Ch. 11 - A geometric progression is defined as the product...Ch. 11 - The Fibonacci sequence occurs frequently in nature...Ch. 11 - Prob. 4PPCh. 11 - Once upon a time in a kingdom far away, the king...Ch. 11 - There are n people in a room, where n is an...Ch. 11 - Prob. 7PPCh. 11 - Prob. 10PPCh. 11 - Prob. 12PP
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Modify Program 7.14 so that the user can convert any number of integers. Make provision for the program to term...
Programming in C
If you are writing a function that accepts an argument and you want to make sure the function cannot change the...
Starting Out with C++: Early Objects
What is a source program?
Absolute Java (6th Edition)
When Option Strict is set to ______ only widening conversions are permitted.
Starting Out With Visual Basic (7th Edition)
Create an object of class Student. You will notice that this time you are prompted not only for a name of the i...
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
A __________ property can be set to one of two possible values: True or False. a. Boolean b. Logical c. Binary ...
Starting out with Visual C# (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
- Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.arrow_forwardMergesort is a method that takes an integer array and returns a sorted copy of the same array. It first sorts the left half of the input array, then the right half of the input array, and finally merges the two sorted halves together into a sorted version of the input array. Implement the mergesort method public static int[] mergesort(int[] arr) { return new int[] {-1}; } *must be in this layout and done in javaarrow_forwardWrite method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example:(in java) Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {arrow_forward
- What will be the problem with the following algorithm for finding an item in an unsorted array? How can you solve it? int location = 0; bool moreToSearch = (location > length); found = false; while (moreToSearch && !found) { if(item == info[location]) { item = info[location]; } else { location++; moreToSearch = (location > length); } }arrow_forwardWrite a program that does the following: 1. prompts the user to guess a letter in a hard-coded word 2. validates the input 3. adds the letter to a two-dimensional array that stores the guessed letter (string) and the number of times that letter has been guessed (int). If the letter is already in the list, then the list should be updated accordingly (i.e., no duplicate letters in the list!) The list will follow this format: [[guessed letter 1, number of guesses],[guessed letter2, number of guesses],...] Example: [[“a”, 3], [“e”, 2], [“c”, 1]] Hint : this will require iterating over the list, remember that the character is always in position [x][0] 4. check if the character is in the word 5. outputs if the character is in the word and the number of times this character has been guessed 6. the program should continue to prompt the user until they enter ‘quit’ Output example: #the word is kookaburra Enter a letter: a The letter ‘a’ is in the word Number of times guessed the letter…arrow_forwardWRITE A JAVA PROGRAM that perform the Insertion Sort, Bubble Sort, Merge Sort, and Quick Sort algorithms on an integer array, such that each program keeps a count of the number of swaps it makes. Then, write an application that uses four identical arrays of a least 20 integers. It should call each method on a different array, and display the number of exchanges made by each algorithm.arrow_forward
- Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the arrayarrow_forwardUsing JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.arrow_forwardImplement the following method to sort the columns in a twodimensional array. A new array is returned and the original array is intact.public static double[ ][ ] sortColumns(double[ ][ ] m) Write a test program that prompts the user to enter a 4 X 4 matrix of doublevalues and displays a new column-sorted matrix. Here is a sample run: Enter a 4−by−4 matrix row by row:0.15 0.875 0.375 0.225 ↵Enter0.55 0.005 0.225 0.015↵Enter0.30 0.12 0.4 0.008 ↵Enter0.07 0.021 0.14 0.2 ↵EnterThe column−sorted array is0.07 0.005 0.14 0.0080.15 0.021 0.225 0.0150.30 0.12 0.375 0.20.55 0.875 0.4 0.225arrow_forward
- Consider the following code segment that includes a method called multiply. The multiply method is a sample method for the multiplication of an n by m array and an m by p array. Suppose the multiply method is invoked as shown, what will be the value of the expressiona5[1][1]?Note that the initializeArray method puts a 0 to every cell of the array passed to initializeArray.arrow_forwardWrite a method SortTheEvens(), that first shifts all the even numbers of an input array to the left side in that array and then sorts all even numbers in that array.Note: You are not allowed to use direct indexing and can only use ptr++ and ptr-- operators. i.e. *(ptr + i) and ptr[i] are not allowed.Do using c++ programming language.arrow_forwardWrite a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License