Hi everybody,
I've copied an example of the program test report for assignment 11 below. Some of you had trouble getting your programs to work well. Please have a look at the output of this assignment. Please also let me know if you need an example implementation.
I didn't use any of your main method to test the programs. I modified them. This is to test everyone's file the same way for all cases. So your own test code will not appear in the test report. But I'll grade on it. For example, I'll have to deduct points if the implementation does not provide a main that tests the sorting method.
A brief explanation of the test cases:
The test for an empty list: the sortting method should handle this case.
The test for one element list: the sorting method should handle this case.
The test for two or several elements list: we expect sorted collections.
The test of a list with duplicated values: in order the test whether the sort method is stable, I modified some of your code. I changed the compareTo to compareToIgnoreCase. This way, we can see if two equal elements is reordered or not. Your implementation is considered correct even if the sort is not stable.
The test of a list with null values: it would be good if our comparemethod in the comparator object handles the case when the parameter variable passed in is a null value. Your implementation is considered correct even if it crashes this test.
If you submitted your assignment 11, you will soon receive an email from me with your report and score. If you haven't received the email by tomorrow, let me know. Also let me know if you have any questions regarding your score.
Cheers!
Jade
Here is your score for Assignment 11.
Score: TDB%
Here I will list any deductions.
Let me know if you have any questions regarding your score. And let me know if you want a copy of an example implementation for the assignment.
Regards,
Jade