Data Structure 4번째 HW

1. Make an interface “StudentLinearList” as shown in
Program 5.1. Implement the “StudentArrayLinearList” class, which is an
implementation of the interface “StudentLinearList”. Modify the time
measuring program, which was used in the last homework, by replacing the
“Student” object array with the “StudentArrayList” class.

2.
Extend “StudentArrayLinearList” to include the method “removeRange”,
which removes all elements in the specified index range. What is the
complexity of your method?

3. Extend “StudentArrayLinearList” to
include the method “concateList”, which concatenates a parameter
“StudentArrayLinearList” to the list of the method-owner object. What is
the complexity of your method? Test your code with a simple example
code.

댓글 남기기