Starting Out with Java: Early Objects (6th Edition)
6th Edition
ISBN: 9780134457963
Author: GADDIS
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 7, Problem 18PC
Search Benchmarks
Modify the sequentialSearch and binarySearch methods presented in this chapter so they keep a count of and display on the screen the number of comparisons they make before finding the value they are searching for. Then write a
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
. Now take any name from the user, find whether that name is present in that array or not, and print the position of that name in the array if found. Write a search method to sequentially search the name from the array. Invoke the search method from the main method. The array and the name to be searched should be passed into the search method as parameters.Now write a Java program to implement binary search for the above problem.[Hint: You can use equals() and compareTo() methods of String class.]
Program64.javaWrite a program that demonstrates method overloading by defining and calling methods that return the area of a triangle, a rectangle, or a square.
Program71.java
Write a program that creates a 32-element array of random integers all from 1 to 100, inclusive. Then execute a custom method with the array as its only argument. The method should begin by using a loop to print the array elements in 4 rows and 8 columns, with all columns being five characters wide. Duplicates are okay. This same loop should determine how many integers in the array are odd numbers. After this loop ends, use this figure to declare a new array of integers named odds. Process the array again in the method, but this time with a foreach loop, and add the odd integers to the odds array. Return the odds array back to main. In main, report the size of the array and sort it ascending. Finally use a while loop to print the odd integers all on one line separated by spaces.
Program71.java
Write a program that creates a 32-element array of random integers all from 1 to 100, inclusive. Then execute a custom method with the array as its only argument. The method should begin by using a loop to print the array elements in 4 rows and 8 columns, with all columns being five characters wide. Duplicates are okay. This same loop should determine how many integers in the array are odd numbers. After this loop ends, use this figure to declare a new array of integers named odds. Process the array again in the method, but this time with a foreach loop, and add the odd integers to the odds array. Return the odds array back to main. In main, report the size of the array and sort it ascending. Finally use a while loop to print the odd integers all on one line separated by spaces.Program72.java
See Section 7.13 and watch the Command Line Arguments (2:08) video (video image below). Then, write a program that takes two double command line arguments representing the sides of…
Chapter 7 Solutions
Starting Out with Java: Early Objects (6th Edition)
Ch. 7.1 - Write statements that create the following arrays:...Ch. 7.1 - Whats wrong with the following array declarations?...Ch. 7.1 - Prob. 7.3CPCh. 7.1 - Prob. 7.4CPCh. 7.1 - Prob. 7.5CPCh. 7.1 - Prob. 7.6CPCh. 7.1 - Prob. 7.7CPCh. 7.1 - Prob. 7.8CPCh. 7.2 - Prob. 7.9CPCh. 7.2 - Prob. 7.10CP
Ch. 7.2 - A program has the following declaration: double[]...Ch. 7.2 - Look at the following statements: final in...Ch. 7.3 - Look at the following method header: public static...Ch. 7.3 - Write a method named zero, which accepts an int...Ch. 7.6 - Prob. 7.15CPCh. 7.7 - Recall that we discussed a Rectangle class in...Ch. 7.9 - What value in an array does the selection sort...Ch. 7.9 - How many times will the selection sort swap the...Ch. 7.9 - Prob. 7.19CPCh. 7.9 - Prob. 7.20CPCh. 7.9 - If a sequential search is performed on an array,...Ch. 7.11 - Prob. 7.22CPCh. 7.13 - What import statement must you include in your...Ch. 7.13 - Write a statement that creates an ArrayList object...Ch. 7.13 - Write a statement that creates an ArrayList object...Ch. 7.13 - Prob. 7.26CPCh. 7.13 - Prob. 7.27CPCh. 7.13 - Prob. 7.28CPCh. 7.13 - Prob. 7.29CPCh. 7.13 - Prob. 7.30CPCh. 7.13 - Prob. 7.31CPCh. 7 - Prob. 1MCCh. 7 - Prob. 2MCCh. 7 - Prob. 3MCCh. 7 - Prob. 4MCCh. 7 - Array bounds checking happens. a. when the program...Ch. 7 - Prob. 6MCCh. 7 - Prob. 7MCCh. 7 - Prob. 8MCCh. 7 - Prob. 9MCCh. 7 - Prob. 10MCCh. 7 - To store an item in an ArrayList object, use this...Ch. 7 - Prob. 12MCCh. 7 - To delete an item from an ArrayList object, you...Ch. 7 - Prob. 14TFCh. 7 - Prob. 15TFCh. 7 - Prob. 16TFCh. 7 - Prob. 17TFCh. 7 - Prob. 18TFCh. 7 - Prob. 19TFCh. 7 - True or False: The Java compiler does not display...Ch. 7 - Prob. 21TFCh. 7 - True or False: The first size declarator in the...Ch. 7 - Prob. 23TFCh. 7 - Prob. 24TFCh. 7 - int[] collection = new int[-20];Ch. 7 - Prob. 2FTECh. 7 - Prob. 3FTECh. 7 - Prob. 4FTECh. 7 - Prob. 5FTECh. 7 - Prob. 1AWCh. 7 - Prob. 2AWCh. 7 - Prob. 3AWCh. 7 - In a program you need to store the populations of...Ch. 7 - In a program you need to store the identification...Ch. 7 - Prob. 6AWCh. 7 - Prob. 7AWCh. 7 - Prob. 8AWCh. 7 - Prob. 9AWCh. 7 - Prob. 10AWCh. 7 - Prob. 11AWCh. 7 - Prob. 1SACh. 7 - Prob. 2SACh. 7 - Prob. 3SACh. 7 - Prob. 4SACh. 7 - Prob. 5SACh. 7 - The following statement creates an InventoryItem...Ch. 7 - Prob. 7SACh. 7 - Prob. 8SACh. 7 - Rainfall Class Write a RainFall class that stores...Ch. 7 - Payroll Class Write a Payroll class that uses the...Ch. 7 - Charge Account Validation Create a class with a...Ch. 7 - Prob. 4PCCh. 7 - Charge Account Modification Modify the charge...Ch. 7 - Drivers License Exam The local Drivers License...Ch. 7 - Magic 8 Ball Write a program that simulates a...Ch. 7 - Grade Book A teacher has five students who have...Ch. 7 - Grade Book Modification Modify the grade book...Ch. 7 - Average Steps Taken A Personal Fitness Tracker is...Ch. 7 - ArrayOperations Class Write a class name...Ch. 7 - 12.1994 Gas Prices In the student sample programs...Ch. 7 - Sorted List of 1994 Gas Prices Note: This...Ch. 7 - Name Search If you have downloaded this books...Ch. 7 - Population Data If you have downloaded this books...Ch. 7 - World Series Champions If you have downloaded this...Ch. 7 - Search Benchmarks Modify the sequentialSearch and...Ch. 7 - 2D Array Operations Write a program that creates a...Ch. 7 - Prob. 19PCCh. 7 - Trivia Game In this programming challenge, you...Ch. 7 - Prob. 21PC
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Modify the temperature conversion program to print a heading above the table.
C Programming Language
A (n) _______operator determines if a specific relationship exists between two values.
Starting Out With Visual Basic (8th Edition)
Why is it useful for a programmer to have some background in language design, even though he or she may never a...
Concepts Of Programming Languages
What classes do you use to read data from a file?
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
Declare method sphereVolume to calculate and return the volume of the sphere. Use the following statement to ca...
Java How To Program (Early Objects)
How is the window manager related to the operating system?
Computer Science: An Overview (12th 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
- Program71.java Write a program that creates a 32-element array of random integers all from 1 to 100, inclusive. Then execute a custom method with the array as its only argument. The method should begin by using a loop to print the array elements in 4 rows and 8 columns, with all columns being five characters wide. Duplicates are okay. This same loop should determine how many integers in the array are odd numbers. After this loop ends, use this figure to declare a new array of integers named odds. Process the array again in the method, but this time with a foreach loop, and add the odd integers to the odds array. Return the odds array back to main. In main, report the size of the array and sort it ascending. Finally use a while loop to print the odd integers all on one line separated by spaces. Program73.java In main: Declare an array capable of holding five first names. Populate the array in a for loop by entering five first names all on one line separated by spaces. sort the array…arrow_forwardExercise 1: Write a program that generates a sequence of 20 random values between 0 and 99 in an array, prints the sequence, sorts it, and prints the sorted sequence. Use the sort method from the standard Java library. Exercise 2: Write a program that stores a list of countries: "Egypt", "Switzerland", "Argentina", "Spain", "Portugal", "Luxemburg", etc. Initialize your array with a single statement. Then print out the array. Use the sort function as before to sort the countries in alphabetical order. Reprint your array. Exercise 3: Implement exercises 1 and 2 using ArrayList. Use the Collections.sort method for sorting. After you have printed and sorted your results, then append an additional element to each list and reprint your ArrayLists. Notice that the new items will appear just at the end and will not be sorted. Resort and print out the new ArrayLists again. To clarify, you should print out your ArrayLists after your first sort, after adding items with the…arrow_forwardPlease do not change any of the method signatures in either class. Implement the methods described below. Partition.java public static int partitionLomuto(int[] arr, int low, int high) Implement this method using Lomuto’s partition algorithm. This is the algorithm that we discussed in class that chooses the last element as the partition and iterates through the array swapping an element that belongs in the low side with the lowest (farthest left) element on the high side. At the end, the pivot is swapped with the lowest element (farthest left) element on the high side. This method should return the index of the pivot element, which is now in its correct position in the array. See the pseudocode below. partition(arr, p, r) x = arr[r] i = p – 1 for j = p to r – 1 if arr[j] ≤ x i = i + 1 swap arr[i] and arr[j] swap arr[i+1] and arr[r] return i+1 What sort of input arrays will enable Hoare’s algorithm to still create relatively equal size partitions whereas Lumoto’s algorithm will create…arrow_forward
- (Java) Open up your Sort.java file from the prior activity. Copy and paste the below method into your file right below bubbleSort. /*** Sorts an array of integers from smallest to largest * using the insertion sort algorithm* @param array the list of integer values*/public static void insertionSort(int array[]) { return; } Write the insertionSort method by using the pseudocode for insertion sort provided above. Now, remove the method call to bubbleSort in main and replace it with a call to insertionSort. Note that you can leave the bubbleSort method inside of your program, you just won't be calling it. You should get the same sorted output as when you called bubbleSort. When finished, upload Sort.javaarrow_forwardThis method contains an implementation error. Explain what this error is, how it manifests itself, how it can be fixed, and why this fix works. The method should return true when an empty array is provided. The same applies when it contains only one element. public static boolean isMinHeap(int arr[], int index) { if (index > (arr.length) / 2) return true; boolean left = (arr[index] <= arr[2*index + 1]) && isMinHeap(arr, 2*index + 1); boolean right = (2*index + 2 == arr.length) || (arr[index] <= arr[2*index + 2] && isMinHeap(arr, 2*index + 2)); return left && right; }arrow_forwardUse C#. Chapter 6 discussed the predefined IndexOf() method of an array; the method takes two parameters, the whole array and an element to search. The method returns the index of the element if found, and -1 if not found. Now, you are asked to write a program that has a method FindMatch() that does exactly the same thing: 1) The Main() calls FindMatch(). 2) FindMatch() takes two parameters: 1) the whole array of integer test scores { 85, 98, 100, 73, 67, 82, 92, 87 }, and 2) an element to search from users input. 3) FindMatch() returns the index of element if found back to the Main(), and -1 if not found. The method should not use IndexOf() to do the search. 4) The program displays either the index or -1 in the Main(). Sample output (from Microsoft Visual Studio) as shown belowarrow_forward
- JAVA PROGRAM ASAP *********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES. Sorting - Lab #7 Create a class called Sort that has three static methods for sorting integer arrays. All three methods should accept an array of integers, have void return type, and should sort the array in-place. 1. public static void bubbleSort(int[] array) { // your code here } 2. public static void insertionSort(int[] array) { // your code here } 3. public static void selectionSort(int[] array) { // your code here } Please enter a space separated list of numbers to sort or type QUIT to exit:\n3 2 1ENTERSorted array using Bubble Sort algorithm:\n1 2 3\nSorted array using Insertion Sort algorithm:\n1 2 3\nSorted array using Selection Sort algorithm:\n1 2 3\nPlease enter a space separated list of numbers to sort or type QUIT to exit:\nquitENTER Test Case 2 Please enter a space separated list of numbers to sort or type QUIT to exit:\n1ENTERSorted array…arrow_forwardjava coding Write a method that will search an integer array for a number and return the count of how many times the number is in the array. The array is not sorted. Any inputs that the method needs must be part of the parameter list, not input from the user or a file or taken from the instance dataarrow_forwardWrite a Java program tat prompts user for a list of integers with 0 as the last value.Save the values in an array. Assume there can be maximum 100 values. Theprogram should have the following methods:- A method that takes the array as parameter and updates each value in thearray to the square of the value.- Another method that takes the original and modified arrays as parametersand displays the original and the squared values.arrow_forward
- TableAA.java Write a program that will store a multiplication table in a 2-D array. The user will enter how many lines (rows) it will have. The table will be printed to the screen. (Make it look nice – consider using printf.) This program will contain a static method. This method will take in an integer (the user’s number) and it will return a 2-D array. The code inside of the method will create the array, fill it with all the appropriate values that one would expect in a multiplication table, and then return that filled array. In the main method, you will ask the user how many lines they want to see and then you will use your static method to get the array. Once you have the array back from the static method, use nested for loops to print it in table form. See samples on the following pages. Program only needs to run once. Add try/catches so the user can only enter positive integers (1 and higher).arrow_forwardA bit new to methods and need a little bit of help. Swap Method Your task is to write a public static method named swap that takes a single parameter which is an array of doubles. This method should swap the first and last element in the array and then return the adjusted double array. You can assume that all arrays passed into the method are a length of 2 or more. For example, the test data provided when passed into the swap method should go from: {8.34, 7.221, 10.643, 93.2} toarrow_forwardJava Programming For this assignment, you are required to create a program named SelectionSortPA.java and implement selection sorting algorithm as specified below: Public static void selectionSort(int[] arr) Your main method accepts a number N from the command argument list. Then use the number N to create an N-element int array. Assign random numbers between [0, Integer.MAX_VALUE) to each of the N elements of the array. Call selectionSort method to sort the array. Display the array elements after each iteration of selection sort. Verify the array is sorted after calling your sorting method. If you implement all the required methods correctly, the driver program should generate outputs similar to the sample below:arrow_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,
9.1: What is an Array? - Processing Tutorial; Author: The Coding Train;https://www.youtube.com/watch?v=NptnmWvkbTw;License: Standard Youtube License