Anyway...yes, I'm almost done with PA1. I have precisely recreated the sample tree that Professor Keenan gave us in the handout. I've been experimenting with different ways to show the tree structure in text form, and the best one I've come up with look like this:
![]() |
It's just like Keenan's example. It just doesn't look like it. |
Other than maybe improving the appearance of my output, these are the tasks remaining before I call it done:
- Finish implementing the PCSInfo calculations.
- Do more thorough unit tests of all classes and methods.
- Document the final solution.
Kick ASS!
ReplyDelete