Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
11th Edition
ISBN: 9780134671710
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 20.6, Problem 20.6.8CP
Write a statement that sorts a two-dimensional array of double[] [] in increasing order of their second column as the primary order and the first column as the secondary order. For example, if the array is double[] [] x = {{3, 1}, {2, −1}, {2, 0}, {1, −1}}, the sorted array will be {{1, −1}, {2, −1}, {2, 0}, {3, 1}}.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Q2. By applying the concept of array in C language, solve the equation as shown in Figure Q2
below where the values of n is the last digit of student matrix number (e.g. CD12345), and
u is the second digit of student matrix number (e.g. CD12345). User need to insert the value
in array x[i] series, for example, EE x; = x [0] + x[1]+ x[2],where xri is a series of value
in data set.
n+2
n+3
10+i
V2i
f (x) =
2x[i]?
i=1
i=0
Figure Q2: (x) equation.
An array is special if every even index contains an
even number and every odd index contains an odd number.
Create a function that returns true if an array is
special, and false otherwise.
Examples
isSpecialArray([2,
7, 4, 9, 6, 1, 6, 3]) → true
// Even indices: [2, 4, 6, 6]; Odd indices: [7, 9, 1,
3]
isSpecialArray([2, 7, 9, 1, 6, 1, 6, 3]) → false
// Index 2 has an odd number 9.
isSpecialArray ([2, 7, 8, 8, 6, 1, 6, 3]) → false
// Index 3 has an even number 8.
Code for this in C:
You have created three arrays:array A of size 100array B of size 50array C of size 200You are to store the first 100 numbers (1,2,3,...,100) into array A, the first 50 positive odd numbers (1,3,5,...,) into array B, and the reciprocal of each position [C(5) = 1/5] into array C. Then, output the contents of each array.
Chapter 20 Solutions
Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
Ch. 20.2 - Prob. 20.2.1CPCh. 20.2 - Prob. 20.2.2CPCh. 20.2 - Prob. 20.2.3CPCh. 20.2 - Prob. 20.2.4CPCh. 20.2 - Prob. 20.2.5CPCh. 20.3 - Prob. 20.3.1CPCh. 20.3 - Prob. 20.3.2CPCh. 20.3 - Prob. 20.3.3CPCh. 20.3 - Prob. 20.3.4CPCh. 20.4 - Prob. 20.4.1CP
Ch. 20.4 - Prob. 20.4.2CPCh. 20.5 - Prob. 20.5.1CPCh. 20.5 - Suppose list1 is a list that contains the strings...Ch. 20.5 - Prob. 20.5.3CPCh. 20.5 - Prob. 20.5.4CPCh. 20.5 - Prob. 20.5.5CPCh. 20.6 - Prob. 20.6.1CPCh. 20.6 - Prob. 20.6.2CPCh. 20.6 - Write a lambda expression to create a comparator...Ch. 20.6 - Prob. 20.6.4CPCh. 20.6 - Write a statement that sorts an array of Point2D...Ch. 20.6 - Write a statement that sorts an ArrayList of...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.7 - Are all the methods in the Collections class...Ch. 20.7 - Prob. 20.7.2CPCh. 20.7 - Show the output of the following code: import...Ch. 20.7 - Prob. 20.7.4CPCh. 20.7 - Prob. 20.7.5CPCh. 20.7 - Prob. 20.7.6CPCh. 20.8 - Prob. 20.8.1CPCh. 20.8 - Prob. 20.8.2CPCh. 20.8 - Prob. 20.8.3CPCh. 20.9 - How do you create an instance of Vector? How do...Ch. 20.9 - How do you create an instance of Stack? How do you...Ch. 20.9 - Prob. 20.9.3CPCh. 20.10 - Prob. 20.10.1CPCh. 20.10 - Prob. 20.10.2CPCh. 20.10 - Prob. 20.10.3CPCh. 20.11 - Can the EvaluateExpression program evaluate the...Ch. 20.11 - Prob. 20.11.2CPCh. 20.11 - If you enter an expression "4 + 5 5 5", the...Ch. 20 - (Display words in ascending alphabetical order)...Ch. 20 - (Store numbers in a linked list) Write a program...Ch. 20 - (Guessing the capitals) Rewrite Programming...Ch. 20 - (Sort points in a plane) Write a program that...Ch. 20 - (Combine colliding bouncing balls) The example in...Ch. 20 - (Game: lottery) Revise Programming Exercise 3.15...Ch. 20 - Prob. 20.9PECh. 20 - Prob. 20.10PECh. 20 - (Match grouping symbols) A Java program contains...Ch. 20 - Prob. 20.12PECh. 20 - Prob. 20.14PECh. 20 - Prob. 20.16PECh. 20 - (Directory size) Listing 18.10,...Ch. 20 - Prob. 20.20PECh. 20 - (Nonrecursive Tower of Hanoi) Implement the...Ch. 20 - Evaluate expression Modify Listing 20.12,...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
When determining whether a number is inside a range, its best to use this operator. a. b. ! c. | | d. ? :
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
What organization was most responsible for the early success of COBOL (in terms of extent of use)?
Concepts Of Programming Languages
For the circuit shown, use the node-voltage method to find v1, v2, and i1.
How much power is delivered to the c...
Electric Circuits. (11th Edition)
ICA 8-64
A 3-volt [V] battery delivers a constant current of 100 milliamperes [mA] to the bulb in a flashlight ...
Thinking Like an Engineer: An Active Learning Approach (4th Edition)
The ____________ is always transparent.
Web Development and Design Foundations with HTML5 (8th Edition)
Summarize the mathematical order of operations, as it works in most programming languages.
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
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
- Using C++ Implement the ordered version of removeElement in the window below. Your function should validate inputs and remove the element in the given position by moving all of the other elements down. // removeElement preserves the order of the remaining elements in the array.// @param: char array that is ordered in some way.// @param: int numElems is the number of elements// @param: int position of the element being removed// @returns true if the element is removed, false otherwise.// be careful to use reference parameters where necessary!arrow_forwardthis is a data structure question read the question carefully and answer it but dont plagarize from internetarrow_forwardC programming languagearrow_forward
- Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…arrow_forwardIf an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code If an array is given, identify the next bigger element for each…arrow_forwardIf an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to codearrow_forward
- function Sum(A,left,right) if left > right: return 0else if left = right: return A[left] mid = floor(N/2) lsum = Sum(A,left,mid) rsum = Sum(A,mid+1,right) return lsum + rsum function CreateB(A,N)B = new Array of length 1 B[0] = Sum(A,0,N-1) return B Building on the above, in a new scenario, given an array A of non-negative integers of length N, additionally a second array B is created; each element B[j] stores the value A[2*j]+A[2*j+1]. This works straightforwardly if N is even. If N is odd then the final element of B just stores A[N-1] as we can see in the figure below: (added in image) The second array B is now introducing redundancy, which allows us to detect if there has been a hardware failure: in our setup, such a failure will mean the values in the arrays are altered unintentionally. The hope is that if there is an error in A which changes the integer values then the sums in B are no longer correct and the algorithm says there has been an error; if there were an error in B…arrow_forwardDEQ[0:4] is an output restricted deque implemented as a circular array, andLEFT and RIGHT indicate the ends of the deque, as shown below. INSERT(“xx”,[LEFT | RIGHT]) indicates the insertion of the data item at the left or right end asthe case may be, and DELETE() deletes the item from the left end only.DEQ: LEFT: 2 RIGHT: 5 [1] [2] [3] [4] [5] [6] C1 A4 Y7 N6Execute the following insertions and deletions on DEQ:i) INSERT(“K9”, RIGHT)ii) DELETE()iii) INSERT(“T5”, LEFT)arrow_forwardsn+2 By applying the concept of array in C language, kindly examine below equation with a C program to calculate the value of f(x), the values of n is the sum of last two digits of student matrix number (e.g. CD190025; n = 2+5). User need to insert the value in array y[i] series, for example, E x = x [0] + x[1] + x[2]. 100 + i f(x) = > Vy[i]? +5 5n i=1 #includearrow_forward
- Write a function that partitions the array into two subarrays: one with all even integers, and the other with all odd integers. Return your result in the following format: [[evens], [odds]] Example: evenoddpartition ([2, 4, 8, 9]) → [[2, 4, 8], [9]] WRITE IN PYTHON PLEASEarrow_forwarddef max_index_diff(array): n = len(array) max_diff = -1 for i in range(0, n): j = n - 1 while(j > i): if array[j] > array[i] and max_diff < (j - i): max_diff = j - i j -= 1 return max_diff array_1 = [20,70,40,50,12,38,98] max_index_diff(array_1)# 6.arrow_forwardCreate a program that can find the mode of a sorted dynamic array and print it. If there is more than one mode found print them in ascending order. Example of array: {20, 30, 30, 50, 70 , 80, 80, 90, 100}. no sorting necessaryarrow_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
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License