TESTING STRATEGY FOR ASSIGNMENT 1
---------------------------------

Each test case has an input file:  testNN.in
and a file of expected output:     testNN.out

-----------------------------------------------------------------------

Basic functions
---------------
1.  the sample data (includes multiple add_votes for one candidate)  
2.  just registering 
3.  just registering & vote adding
4.  3 + printing riding reports, nothing else
5.  3 + printing party reports, nothing else
6.  riding reports, then party reports
7.  party reports, then riding reports

Boundary cases for # of candidates, and # of ridings
----------------------------------------------------
8.  1 riding 1 candidate
9.  1 riding 2 candidates
10. 1 riding 10 candidates
11. 2 ridings 1 candidate in each (different parties)
12. 2 ridings 1 candidate in each (same parties)
13. 2 ridings 4 candidates each(same parties)

Sorting
-------
14. already in sorted order
15. out of sorted order

16. 2-way tie for winner in one riding (already sorted)
17. 2-way tie for winner in one riding (not already sorted)
18. all-way tie for winner (not already sorted)
19. tie for non-winner. (not already sorted)

Boundary cases for #-of-votes
-----------------------------
20. no votes for one candidate in one riding
21. no votes in a whole riding
22. no votes for a party
23. no votes at all

Others
------
24. big test: 15 ridings, with diff amts. of candidates in each
25. each party wins one seat
26. one party wins all seats