A "peak" is an entry in an integer array that is bigger than or equal to the adjacent integers, while a "valley" is an element that is smaller than or equal to the surrounding numbers. In the array, for example, 5, 8, 6, 2, 3, 4, 6 are peaks while 5, 2 are troughs. Sort an array of numbers into an alternating series of peaks and troughs. EXAMPLE Input: {5, 3, 1, 2, 3} Output: {5, 1, 3, 2, 3}

A "peak" is an entry in an integer array that is bigger than or equal to the adjacent integers, while a "valley" is an element that is smaller than or equal to the surrounding numbers. In the array, for example, 5, 8, 6, 2, 3, 4, 6 are peaks while 5, 2 are troughs. Sort an array of numbers into an alternating series of peaks and troughs. EXAMPLE Input: {5, 3, 1, 2, 3} Output: {5, 1, 3, 2, 3}

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 14RQ

See similar textbooks

Similar questions

A minimax or saddle point in a two-dimensional array is an element that is the minimum of its row and the maximum of its column, or vice verse. For example, in the following array11 22 33 33 99 55 66 77 77 44 99 22the element 33 is a minimax because it is the maximum of row 0 and the minimum of column 2. The element 55 is another minimax because it is the minimum of row 1 and the maximum of column 1.Write a program that reads a 4-by-3 matrix, and then prints the location and value of each minimax in the matrix. For example, it would printa[0][2] = 33 is a minimax a[1][1] = 55 is a minimaxfor the matrix shown above.
Part-A: Consider first ten letters of your name and for each letter encode with an integer number. For example: If “Ahmed Naser” are the first ten letters from your name, then the array of integers will be {0, 7, 12, 4, 3,13,0,18,4,17}. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 a b c d e f g h i j k l m n o p q r s t u v w x y z Using the created array, demonstrate below sorting algorithms. It is very important that in each demonstration includes all intermediate arrays in obtaining the final sorted output. Bubble Sort Selection Sort Insertion Sort Shell Sort Merge Sort Quick Sort
Sales.java contains a Java program that prompts for and reads in the sales for each of 5 salespeople in a company. Now modify the program as follows: Declare an array called sales to save the sales of 5 salespeople. Complete the header of the first for loop. This loop initializes the array. Complete the header of the second for loop. This loop computes the total of array elements. Add code to compute and print the average sale. Add another loop to print the id of each salesperson and the number of their sales. The salespeople are objecting to having an id of 0—no one wants that designation. Modify your program so that the IDs run from 1-5 instead of 0-4. // *************************************************************** // Sales.java // // Reads in and stores sales for each of 5 salespeople. Displays // sales entered by salesperson id and total sales for all salespeople. // // *************************************************************** import java.util.Scanner;…
2D arrays (matrices/grids) Write a program that takes 20 student objects and stores them in an array. Each Student object should have a first name and a last name. Sort the array by student’s last name. You can use any of the sorts you have. Then put the names into a 2D array that has 5 rows and 4 columns. Create 2 seating charts by printing the 2D array. Student 17 Student 18 Student 19 Student 20 Student 13 Student 14 Student 15 Student 16 Student 9 Student 10 Student 11 Student 12 Student 5 Student 6 Student 7 Student 8 Student 1 Student 2 Student 3 Student 4 Student 5 Student 10 Student 15 Student 20 Student 4 Student 9 Student 14 Student 19 Student 3 Student 8 Student 13 Student 18 Student 2 Student 7 Student 12 Student 17 Student 1 Student 6 Student 11 Student 16
Area code processing In US, long distance phone call is made by dialing the three digits area code first, followed by 7 digits phone number The following is a list of some US area code using JavaScript code (not the most current. There are more) var AreaCode=new Array(205,251,659,256,334,907,403,780,264,268,520,928,480,602,623,501,479,870,242,246,441, 250,604,778,284,341,442,628,657,669,747,752,764,951,209,559,408,831,510,213,310,424,323,562,707,369,627, 530,714,949,626,909,916,760,619,858,935,818,415,925,661,805,650,600,809,345,670,211,720,970,303,719,203, 475,860,959,302,411,202,767,911,239,386,689,754,941,954,561,407,727,352,904,850,786,863,305,321,813,470, 478,770,678,404,706,912,229,710,473,671,808,208,312,773,630,847,708,815,224,331,464,872,217,618,309,260,317, 219,765,812,563,641,515,319,712,876,620,785,913,316,270,859,606,502,225,337,985,504,318,318,204,227,240,443, 667,410,301,339,351,774,781,857,978,508,617,413,231,269,989,734,517,313,810,248,278,586,679,947,906,616,320,…
A three-dimensional array called watermelon is declared as based on the row-wise manner as below: int watermelon [3][2][2]= {9, 7, 1, 5, 9, 7, 1, 5, 9, 7 ,1, 5}; Rewrite the sequence of watermelon array if it is accessed in column wise manner. Select one: A.9 9 9 7 7 7 1 1 1 5 5 5 B.9 7 1 5 9 9 7 7 1 1 5 5 C.5 1 7 9 5 1 7 9 5 1 7 9 D.9 7 1 5 9 7 1 5 9 7 1 5
An array int[] intArray can be initialized during its definition by A.) It can't be initialized B.) by writing int[] intArray = {1.0f}; C.) by writing int[] intArray = {0,1,2}; D.) by writing int[0-10] intArray = {0,1,2,3,4,5,6,7,8,9};
Peaks and Valleys: In an array of integers, a "peak" is an element which is greater than or equalto the adjacent integers and a "valley" is an element which is less than or equal to the adjacentintegers. For example, in the array {5, 8, 6, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given anarray of integers, sort the array into an alternating sequence of peaks and valleys.EXAMPLEInput: {5, 3, 1, 2, 3}Output: {5, 1, 3, 2, 3}
Return the First Element in an Array JavaScript Create a function that takes an array containing only numbers and return the first element. Examples getFirstValue ([1, 2, 3]) → 1 getFirstValue ([80, 5, 100])→ 80 getFirstValue ([-500, 0, 50])-500
This program is written in java. 2D arrays (matrices/grids) Write a program that takes 20 student objects and stores them in an array. Each Student object should have a first name and a last name. Sort the array by student’s last name. You can use any of the sorts you have. Then put the names into a 2D array that has 5 rows and 4 columns. Create and print 2 seating charts by printing the 2D array, formatted as shown below. Student 17 Student 18 Student 19 Student 20 Student 13 Student 14 Student 15 Student 16 Student 9 Student 10 Student 11 Student 12 Student 5 Student 6 Student 7 Student 8 Student 1 Student 2 Student 3 Student 4 second chart should look randomized, like this. Student 4 Student 8 Student 12 Student 16 Student 20 Student 3 Student 7 Student 11 Student 15 Student 19 Student 2 Student 6 Student 10 Student 14 Student 18 Student 1 Student 5 Student 9 Student…
JAVAWrite a program that searches person's name and display all matched name. For example, if a user inputs the letter "Davis", the program searches all name which includes "Davis" in an array. Then, display all matched names on the screen. You must declare a single dimensional array which has all people’s name. Use methods of string class
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example:d=2arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d: the amount to rotate by 2. int arr[n]: the array to rotate Returns 1. int[n]: the rotated array Input Format: The first line contains two space-separated integers that denote n, the number of integers, and d, the number of left rotations to perform.The second line contains n space-separated integers that describe arr[]. Constraints: 1. 1<=n<=10^5 2. 1<=d<=n 3. 1<=a[i]<=10^6