Step 3. Test your program. Below is an example of what the program output should look like. Your output will be different because the 10 random numbers will not be the same as the example. Use the Snip It tool in Windows or a similar tool on the Mac to cut and paste the Eclipse Console output window into the same Word document as the algorithm in Step 1. C7_Project (2) [Java Application] C:\Program Files\Java\jre1.8.0_131\bin\javaw.exe (Mar 26, 2019, 11:24:20 AM) The largest value is 100 The unsorted list is: 64 24 25 The sorted list is: 3 5 24 48 71 100 5 81 3 48 64 71 81 100

Step 3. Test your program. Below is an example of what the program output should look like. Your output will be different because the 10 random numbers will not be the same as the example. Use the Snip It tool in Windows or a similar tool on the Mac to cut and paste the Eclipse Console output window into the same Word document as the algorithm in Step 1. C7_Project (2) [Java Application] C:\Program Files\Java\jre1.8.0_131\bin\javaw.exe (Mar 26, 2019, 11:24:20 AM) The largest value is 100 The unsorted list is: 64 24 25 The sorted list is: 3 5 24 48 71 100 5 81 3 48 64 71 81 100

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 7PE

See similar textbooks

Similar questions

Define an array to be a 121 array if all elements are either 1 or 2 and it begins with one or more 1s followed by a one or more 2s and then ends with the same number of 1s that it begins with. Write a method named is121Array that returns 1 if its array argument is a 121 array, otherwise, it returns 0. There is one additional requirement. You should return 0 as soon as it is known that the array is not a 121 array; continuing to analyze the array would be a waste of CPU cycles. If you are programming in Java or C#, the function signature isint is121Array(int[ ] a) If you are programming in C or C++, the function signature isint is121Array(int a[ ], int len) where len is the number of elements in the array a. Examples a is then function returns reason {1, 2, 1} 1 because the same number of 1s are at the beginning and end of the array and there is at least one 2 in between them. {1, 1, 2, 2, 2, 1, 1} 1 because the same number of 1s are at the beginning and end of…
Using the following two string arrays, output the first item from the first array with the first item from the second array on the same line (OUTPUT: red Ford). Then, output the second item from each array and output the result. Do this for all four items. String[] firstArray = {“red”, “blue”, “yellow”, “black”}; String[] secondArray = {“Ford”, “Honda”, “GM”, “Toyota”};
Create a game similar to Hangman named GuessAWord in which a player guessesletters to try to replicate a hidden word. Store at least eight words in an array, andrandomly select one to be the hidden word. (The statements needed to generate arandom number are shown in the Exercises in the “Decision Making” and “Looping”chapters.) Initially, display the hidden word using asterisks to represent each letter.Allow the user to guess letters to replace the asterisks in the hidden word until theuser completes the entire word. If the user guesses a letter that is not in the hiddenword, display an appropriate message. If the user guesses a letter that appears multipletimes in the hidden word, make sure that each correct letter is placed. Figure 6-27shows typical games in progress in a console-based application and in a GUIapplication. In the GUI application, the user has successfully guessed e, and is about toguess r. Hint: If you create the GUI version of the game, you might want to include…
In java, please read the text file as array. Then, replace the null with 0 and calculate the sum of the new students in ABC University.Example of text file: (university,year,total_students,new_students,new_staff,ABC, 2000, 3457, , ,ABC, 2001, 3675,218, ,EFG, 2000, 2389,602, ,EFG, 2001, 2785,396, 65,)
write java statement to shift the content of each cell of an integer array one place to the right, except for the content of the last cell, which should be moved into the cell with subscript 0. Thus for example, if the array looks like this: 0 1 2 3 4 5 2 9 3 7 then the array will be changed to look like this: 0 1 2 3 4 7 5 2 9 3
I need help with this Java problem as it's explained in the image below: Image attached can not edit only the code below: public class ShoppingList{ public void add(Item item){ // *** Student task #1 *** /* Requirements: 1. if null item is not allowed: do nothing if null 2. if the list is full, double the array size-dynamic array allocation 3. No duplicated items-all items' names must be unique. If an item with the same name already exists in the list, simply add quantity to the existing item in the list 4. insert the item to the array to maintain sorted-items are sorted based on item names. *** Enter your code below *** */ } public void remove(Item item){//remove all items with the same name. // *** Student task #2 *** /* Requirements: 1. If item not found(item name), display the item does not exists in the list otherwise, remove the item…
Please don't change anything. Put your code in line 7, 11 and 13. Write a method named getSquares which takes an integer array and returns a new integer array of the same length where each element is the square of the corresponding element in the input array. For example, if the input array is {2, 4, 5} the output would be {4, 16, 25}.
Write a static method blur(double[][]picture) that you could use on a part of a picture file to obscure a detail such as a person’s face or a license plate number. This method computes the weighted averages of the values in picture and returns them in a new two-dimensional array. To find a weighted average of a group of numbers, you count some of them more than others. Thus, you multiply each item by its weight, add these products together, and divide the result by the sum of the weights. For each element in picture, compute the weighted average of the element and its immediate neighbors. Store the result in a new two dimensional array in the same position that the element occupies in picture. This new array is the one the method returns. The neighbors of an element in picture can be above, below, to the left of, and to the right of it, either vertically, horizontally, or diagonally. So each weighted average in the new array will be a combination of up to nine values from the array…
In this project you will generate a poker hand containing five cards randomly selected from a deck of cards. The names of the cards are stored in a text string will be converted into an array. The array will be randomly sorted to "shuffle" the deck. Each time the user clicks a Deal button, the last five cards of the array will be removed, reducing the size of the deck size. When the size of the deck drops to zero, a new randomly sorted deck will be generated. A preview of the completed project with a randomly generated hand is shown in Figure 7-50.
Write a program that creates a two dimensional array with 4 rows and 3 columns that contains the below numbers. Let the computer prompt you to enter these numbers. 8 6 1 7 3 0 2 5 9 5 6 7 After that, calculate and print the total and average of these values.
Create a new program named compTask1.py and add comments and code to answer the fol ○ Why doesn’t np.array((1, 0, 0), (0, 1, 0), (0, 0, 1,dtype=float) create a two dimensional array? Write it the correctway. (Help here)○ What is the difference between a = np.array([0, 0, 0]) and a =np.array([[0, 0, 0]])?○ A 3 by 4 by 4 is created with arr = np.linspace(1, 48,48).reshape(3, 4, 4). Index or slice this array to obtain the following(help here, here and here):■ 20.0■ [ 9. 10. 11. 12.]■ [[33. 34. 35. 36.] [37. 38. 39. 40.] [41. 42. 43. 44.] [45. 46. 47. 48.]]■ [[5. 6.], [21. 22.] [37. 38.]]■ [[36. 35.] [40. 39.] [44. 43.] [48. 47.]]■ [[13. 9. 5. 1.] [29. 25. 21. 17.] [45. 41. 37. 33.]]■ [[1. 4.] [45. 48.]]■ [[25. 26. 27. 28.], [29. 30. 31. 32.], [33. 34. 35. 36.], [37. 38. 39. 40.]]Hint: use flatten (help here) and reshape.
Create an ArrayList, Named it Husnain that can hold Integers, and fill each slot with a different random value from 1-50. Display those values on the screen, and then prompt the user for an integer to search through the ArrayList, and if the item is present, say so. It is not necessary to display anything if the value was not found. If the item is in the ArrayList multiple times, it's okay if the program prints the message more than once