Write the following generic method using selection sort and a comparator: public static void selectionSort (E[] list, Comparator comparator) Write a test program that creates an array of 10 GeometricObjects and invokes this method using the GeometricObjectComparator introduced in Listing 20.5 to sort the elements. Display the sorted elements. Use the following statement to create the array: GeometricObject[] list1 = {new Circle (5), new Rectangle(4, 5), new Circle(5.5), new Rectangle (2.4, 5), new Circle (0.5), new Rectangle(4, 65), new Circle (4.5), new Rectangle(4.4, 1), new Circle(6.5), new Rectangle(4, 5)}; Also in the same program, write the code that sorts six strings by their last character. Use the following statement to create the array: String[] list2 = {"red", "blue", "green", "yellow", "orange", "pink"};

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

I need help With this problem for JAVAFX. if possible can it work in eclipse.

GeometricObjects code

public abstract class GeometricObject { private String color = "white"; private boolean filled; private java.util.Date dateCreated; /** Construct a default geometric object */ protected GeometricObject() { dateCreated = new java.util.Date(); } /** Construct a geometric object with color and filled value */ protected GeometricObject(String color, boolean filled) { dateCreated = new java.util.Date(); this.color = color; this.filled = filled; } /** Return color */ public String getColor() { return color; } /** Set a new color */ public void setColor(String color) { this.color = color; } /** Return filled. Since filled is boolean, * the get method is named isFilled */ public boolean isFilled() { return filled; } /** Set a new filled */ public void setFilled(boolean filled) { this.filled = filled; } /** Get dateCreated */ public java.util.Date getDateCreated() { return dateCreated; } @Override public String toString() { return "created on " + dateCreated + "\ncolor: " + color + " and filled: " + filled; } /** Abstract method getArea */ public abstract double getArea(); /** Abstract method getPerimeter */ public abstract double getPerimeter(); }

GeometricObjectComparator

import java.util.Comparator; public class GeometricObjectComparator implements Comparator<GeometricObject>, java.io.Serializable { public int compare(GeometricObject o1, GeometricObject o2) { return o1.getArea() > o2.getArea() ? 1 : o1.getArea() == o2.getArea() ? 0 : -1; } }

the error i get is in one of the pictures.

Write the following generic method using selection sort and a comparator:
public static <E> void selectionSort (E[] list, Comparator<? super E> comparator)
Write a test program that creates an array of 10 GeometricObjects and invokes this method using the GeometricObject Comparator introduced in Listing 20.5 to sort the elements.
Display the sorted elements. Use the following statement to create the array:
GeometricObject[] list1 = {new Circle(5), new Rectangle(4, 5),
new Circle(5.5), new Rectangle(2.4, 5), new Circle (0.5),
new Rectangle(4, 65), new Circle(4.5), new Rectangle(4.4, 1),
new Circle(6.5), new Rectangle(4, 5)};
Also in the same program, write the code that sorts six strings by their last character. Use the following statement to create the array:
String[] list2 = {"red", "blue", "green", "yellow", "orange", "pink"};
Transcribed Image Text:Write the following generic method using selection sort and a comparator: public static <E> void selectionSort (E[] list, Comparator<? super E> comparator) Write a test program that creates an array of 10 GeometricObjects and invokes this method using the GeometricObject Comparator introduced in Listing 20.5 to sort the elements. Display the sorted elements. Use the following statement to create the array: GeometricObject[] list1 = {new Circle(5), new Rectangle(4, 5), new Circle(5.5), new Rectangle(2.4, 5), new Circle (0.5), new Rectangle(4, 65), new Circle(4.5), new Rectangle(4.4, 1), new Circle(6.5), new Rectangle(4, 5)}; Also in the same program, write the code that sorts six strings by their last character. Use the following statement to create the array: String[] list2 = {"red", "blue", "green", "yellow", "orange", "pink"};
1 package application;
2 import java.util.Comparator;
3 ¤¶
4 public class Main {9
50
public static <E> void selectionSort (E[] list, Comparator<?. super. E> comparator). {9
for (int i = 0; i < list.length 1; i++) {9
int minIndex = i;
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20 ¤¶
210
22
X23
24
25
26
27
28
29
30
31
32
33
34
x35
36
37
38
39
40
41 ¤¶
x
2
for (int j =i+1; j<·list.length; j++) {¤9
if (comparator.compare(list[j], list[minIndex]) < 0) {
minIndex = •j;ng
}ng
}*9
if (minIndex != i) {9
·E· temp·=·list[i];*9
·list[i] = list [minIndex];
.list[minIndex] = temp;
·}x9
public static <GeometricObject> void main(String[] args) {9
.//. Test sorting GeometricObject array
GeometricObject[] list1 = {
new Circle(5), new Rectangle(4, 5),
new Circle(5.5), new Rectangle(2.4, 5), new Circle(0.5)
new Rectangle(4, 65), new Circle (4.5) new Rectangle(4.41),FI
new Circle(6.5), new Rectangle(4, 5)
System.out.println("Before sorting:");"
for. (GeometricObject obj: list1). {9
System.out.println (obj);
selectionSort (list1, new GeometricObjectComparatoc());
System.out.println("\nAfter sorting:");
for (GeometricObject obj: list1). {9
System.out.println(obj);
}¤¶
Transcribed Image Text:1 package application; 2 import java.util.Comparator; 3 ¤¶ 4 public class Main {9 50 public static <E> void selectionSort (E[] list, Comparator<?. super. E> comparator). {9 for (int i = 0; i < list.length 1; i++) {9 int minIndex = i; 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ¤¶ 210 22 X23 24 25 26 27 28 29 30 31 32 33 34 x35 36 37 38 39 40 41 ¤¶ x 2 for (int j =i+1; j<·list.length; j++) {¤9 if (comparator.compare(list[j], list[minIndex]) < 0) { minIndex = •j;ng }ng }*9 if (minIndex != i) {9 ·E· temp·=·list[i];*9 ·list[i] = list [minIndex]; .list[minIndex] = temp; ·}x9 public static <GeometricObject> void main(String[] args) {9 .//. Test sorting GeometricObject array GeometricObject[] list1 = { new Circle(5), new Rectangle(4, 5), new Circle(5.5), new Rectangle(2.4, 5), new Circle(0.5) new Rectangle(4, 65), new Circle (4.5) new Rectangle(4.41),FI new Circle(6.5), new Rectangle(4, 5) System.out.println("Before sorting:");" for. (GeometricObject obj: list1). {9 System.out.println (obj); selectionSort (list1, new GeometricObjectComparatoc()); System.out.println("\nAfter sorting:"); for (GeometricObject obj: list1). {9 System.out.println(obj); }¤¶
Expert Solution
Step 1

We have been given GeometricObject[] list1 = {new Circle (5), new Rectangle(4, 5),
new Circle(5.5), new Rectangle(2.4, 5), new Circle(0.5),
new Rectangle(4, 65), new Circle(4.5), new Rectangle(4.4, 1),
new Circle(6.5), new Rectangle(4, 5)}; We have to create a test program that creates an array of 10 GeometricObjects and invokes this method using the GeometricObjectComparator.

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY