Question

using JAVA C: Programming II Consider the Box class. 1 public abstract class Box implements Comparable<Box>{ 2 public String a; 3 protected String b; 4 5 public Box(String a, String b){ 6 this.a = a; 7 this.b = b; 8 } 9 } Rewrite the class so that it is a concrete class. The natural ordering of boxes is such that (let b1 and b2 be two box instances): \begin{itemize} \item b1 < b2 whenever b1.a comes before b2.a alphabetically (lexicographic). \item b1 < b4 whenever b1.a and b2.a are the same the length of b1.a + b1.b is less than the length of b2.a + b2.b. \item b1 is equal to b2 when b1.a is the same as b2.a and the lengths of b1.a + b1.b and b2.a + b2.b are the same. \end{itemize} This natural ordering should not be able to be redefined in any subclass.

          using JAVA

C: Programming II
Consider the Box class.
1 public abstract class Box implements Comparable<Box>{
2 public String a;
3 protected String b;
4
5 public Box(String a, String b){
6 this.a = a;
7 this.b = b;
8 }
9 }
Rewrite the class so that it is a concrete class. The natural ordering of boxes is such that
(let b1 and b2 be two box instances):
\begin{itemize}
    \item b1 < b2 whenever b1.a comes before b2.a alphabetically (lexicographic).
    \item b1 < b4 whenever b1.a and b2.a are the same the length of b1.a + b1.b is less than the
    length of b2.a + b2.b.
    \item b1 is equal to b2 when b1.a is the same as b2.a and the lengths of b1.a + b1.b and
b2.a + b2.b are the same.
\end{itemize}
This natural ordering should not be able to be redefined in any subclass.

using JAVA

C: Programming II
Consider the Box class.
1 public abstract class Box implements Comparable<Box>
2 public String a;
3 protected String b;
4
5 public Box(String a, String b)
6 this.a = a;
7 this.b = b;
8
9
Rewrite the class so that it is a concrete class. The natural ordering of boxes is such that
(let b1 and b2 be two box instances):

* b1 < b2 whenever b1.a comes before b2.a alphabetically (lexicographic).

* b1 < b4 whenever b1.a and b2.a are the same the length of b1.a + b1.b is less than the
length of b2.a + b2.b.

* b1 is equal to b2 when b1.a is the same as b2.a and the lengths of b1.a + b1.b and
b2.a + b2.b are the same.

This natural ordering should not be able to be redefined in any subclass.

Added by Jason V.

Question

Please give Ace some feedback