write a class called rectangle that implements the Comparable The class should contain three fields: height (int), width (int), topCorner (Point). Write the necessary constructors, accessors, mutators and other methods. The Point class is given below.write a client class, rectangleClient that creates an Array of ten Rectangle objects called Array1.Print the Array.Sort the elements according to the height. If the height of any objects are equal, then sort according to width and if the width are still equal as well, then sort according topCorner (hint: call the Point.compareTo() method).Print the sorted list.public class Point implements Comparable<Point> { private int x; private int y; public Point() { this(0, 0); } public Point(int x, int y) { this.x=x; this.y=y; } public int getX() { return x; } public int getY() { return y; } public String toString() { return "(" + x + ", " + y + ")"; } public int compareTo(Point pt){ if(this.x==pt.x) return this.y-pt.y; else return this.x-pt.x; }}

import java.util.*;//1. definition for Class Rectanglepublic class Rectangle implements…

Answered: write a class called rectangle that…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

write a class called rectangle that implements the Comparable The class should contain three fields: height (int), width (int), topCorner (Point). Write the necessary constructors, accessors, mutators and other methods. The Point class is given below.
write a client class, rectangleClient that creates an Array of ten Rectangle objects called Array1.
1. Print the Array.
2. Sort the elements according to the height. If the height of any objects are equal, then sort according to width and if the width are still equal as well, then sort according topCorner (hint: call the Point.compareTo() method).

Print the sorted list.

public class Point implements Comparable<Point> {

private int x;

private int y;

public Point() {

this(0, 0);

}

public Point(int x, int y) {

this.x=x;

this.y=y;

}

public int getX() {

return x;

}

public int getY() {

return y;

}

public String toString() {

return "(" + x + ", " + y + ")";

}

public int compareTo(Point pt){

if(this.x==pt.x)

return this.y-pt.y;

else

return this.x-pt.x;

}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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