
Explanation of Solution
Complete program:
The complete executable code after changing the array of values of type “int” to type “double” in “selectionSort” method of class “ArraySorter” is given below:
Modified “ArraySorter.java”
/**
Class for sorting an array of base type "double" from smallest to largest.
*/
public class ArraySorter
{
/* Method definition for sorting the array using selection sort */
public static void selectionSort(double[] anArray)
{
/* Sort the array using "for" loop */
for (int index = 0; index < anArray.length - 1; index++)
{
/* Place the correct value in anArray[index] by calling "getIndexOfSmallest" method */
int indexOfNextSmallest = getIndexOfSmallest(index, anArray);
/* Call interchange() method */
interchange(index, indexOfNextSmallest, anArray);
}
}
/** Returns the index of the smallest value in the portion of the array that begins at the element whose index is startIndex and ends at the last element. */
/* Method definition for gets index of smallest element */
private static int getIndexOfSmallest(int startIndex, double[] a)
{
/* Assign minimum value */
double min = a[startIndex];
/* Assign index of minimum value */
int indexOfMin = startIndex;
/* Compute the index of minimum value using "for" loop */
for (int index = startIndex + 1; index < a.length; index++)
{
if (a[index] < min)
{
min = a[index];
indexOfMin = index;
// Assertion: min is smallest of a[startIndex] through a[index]
}
}
/* Return index of minimum element */
return indexOfMin;
}
/** Precondition: i and j are valid indices for the array a.
Postcondition: Values of a[i] and a[j] have been interchanged. */
/* Method definition for interchange value of array */
private static void interchange(int i, int j, double[] a)
{
double temp = a[i];
a[i] = a[j];
a[j] = temp; //original value of a[i]
}
}
Filename: “SelectionSortDemo.java”
//Define "SelectionSortDemo" class
public class SelectionSortDemo
{
//Define main function
public static void main(String[] args)
{
//Initializes the values for "myArray"
double[] myArray = {8...
Want to see the full answer?
Check out a sample textbook solution
Chapter 7 Solutions
Java: An Introduction to Problem Solving and Programming (7th Edition)
Additional Engineering Textbook Solutions
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Electric Circuits. (11th Edition)
Thinking Like an Engineer: An Active Learning Approach (4th Edition)
Degarmo's Materials And Processes In Manufacturing
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
- The following entity-relationship (ER) diagram models a database that helps car deal- ers maintain records of customers and cars in their inventory. Construct a relational database schema from the ER diagram. Your set of schemas should include primary-key and foreign-key constraints and you should ensure there are no redundant schemas. has_model model modelID name vehicle has_vehicle VIN dealer_ID brand name has_available_option has_option has_dealer options options_ID specification dealer dealer ID name customer_ID owned_by customer customer ID namearrow_forwardA relation schema R = (A, B, C, D, E) with a set of functional dependencies F= {D A CAB} is decomposed into R₁ = (A, B, C) and R2 = (C, D, E). (a) Is this a lossless-join decomposition? Why or why not? (b) Is the decomposition dependency preserving? Why or why not?arrow_forwardNo chatgpt pleasearrow_forward
- Please help draw alu diagraarrow_forward1. Level the resources (R) for the following network. Show exactly which activity is being moved at each cycle and how many days it is being moved. Show all cycles required to utilize the free float and the back float. B H 3 3 L 2 0-0-0 A C F G K N P Q T 0 3 2 2 1 2-2-2 7R 8R 4R 6R 4R 2R 5R 4R D 1 2R 2 M 000 4R 2 4R 1 2 3 4 B5 B BE B 5 5 7 D 2003 C NO C MBSCM В H 5 2 F 7 7 8 SH2F80 5 Н Н 6 7 7L3G4+ 6H2G4 J 4 4 14 8 L K 00 36 9 10 11 12 13 14 15 P 2 Z+ N N 4 4 Z t 2334 4 Σ + M M 4 +arrow_forward2. Perform resource allocation for the following project. Resource limits are 6 labors and 2 helpers. Legend: Activity Dur Resources G H 2 3 2L 1H 2L OH A 1 3L 1H + B D F J K 3 4 6 2 4 4L 2H 3L OH 4L 1H 2L 2H 4L 2H C E 2 2 I 1 2L 1H 3L 1H 5L 1Harrow_forward
- Need Java method please. Thank you.arrow_forwardNeed Java method please. Thank you.arrow_forward3. Write two nested loops to generate the following output. (Note: There is one space between each number, and any extra line shown is intentional.) 12 10 8 6 18 15 12 24 20 30 2 3 3 6 48 12 5 10 15 20 6 12 18 24 30arrow_forward
- Write in verilog coding languagearrow_forwardQ4. Consider the following two design alternatives. Walmart Walmart Store locartion 1 * capacity - Associate Name 1 id position Design Alternative "A" Store locartion 1 capacity Associate Name 1 * id position Design Alternative "B" a) Explain the semantic differences between the two designs, if any. b) Explain the differences in how each design alternative may be implemented in Java. c) which design alternative may require more storage requirement in your opinion, and why?arrow_forwardDesign a schematic for a compartmental model that includes compartments, flows, and parameters with their respective units, using Figure 1 as a guide. For each flow, determine whether it is best represented by a first-order transfer, a Michaelis-Menten saturable process, or a different method.arrow_forward
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,Np Ms Office 365/Excel 2016 I NtermedComputer ScienceISBN:9781337508841Author:CareyPublisher:Cengage
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr



