doesn't have to be nested
This commit is contained in:
committed by
JamesFlare1212
parent
07f53dedfe
commit
3d5614564f
@@ -107,14 +107,15 @@ You must do this assignment on your own, as described in the [Collaboration Poli
|
|||||||
- One of name, collaborators, or hours not filled in. (-1)
|
- One of name, collaborators, or hours not filled in. (-1)
|
||||||
- Two or more of name, collaborators, or hours not filled in. (-2)
|
- Two or more of name, collaborators, or hours not filled in. (-2)
|
||||||
- No reflection. (-1)
|
- No reflection. (-1)
|
||||||
- LETTER GRID REPRESENTATION (3 pts)
|
<!-- - LETTER GRID REPRESENTATION (3 pts)
|
||||||
- Grid is not represented via nested structure vector<vector<char>>, vector<vector<string>>, vector<string>, char\*\*, etc. (-2)
|
- Grid is not represented via nested structure vector<vector<char>>, vector<vector<string>>, vector<string>, char\*\*, etc. (-2)
|
||||||
- Lookup of a position is not O(1), uses something like<list<char>> which has lookup of O(n). (-1)
|
- Lookup of a position is not O(1), uses something like<list<char>> which has lookup of O(n). (-1)
|
||||||
- Incomplete to the point that no grid representation is evident within their code. (-2)
|
- Incomplete to the point that no grid representation is evident within their code. (-2)
|
||||||
- USES RECURSION (7 pts)
|
-->
|
||||||
|
- USES RECURSION (10 pts)
|
||||||
- Use some non-trivial recursion but doesn’t use recursion in the search process of board creation. (-3)
|
- Use some non-trivial recursion but doesn’t use recursion in the search process of board creation. (-3)
|
||||||
- Uses recursion but only trivially. (-5)
|
- Uses recursion but only trivially. (-7)
|
||||||
- Does not use any recursion. (-7)
|
- Does not use any recursion. (-10)
|
||||||
<!-- - ALGORITHM ANALYSIS (In terms of the grid dimensions, the # of words, # of letters per word, the number of solutions etc. Looking for both an answer in order notation and a well-written justification in the plaintext README.txt file.) (5 pts)
|
<!-- - ALGORITHM ANALYSIS (In terms of the grid dimensions, the # of words, # of letters per word, the number of solutions etc. Looking for both an answer in order notation and a well-written justification in the plaintext README.txt file.) (5 pts)
|
||||||
- No order notation provided (-5)
|
- No order notation provided (-5)
|
||||||
- Order notation not written in terms of the provided variables w,h,r,f,l,s. Introduces new vars or provides it just in terms of n. (-2)
|
- Order notation not written in terms of the provided variables w,h,r,f,l,s. Introduces new vars or provides it just in terms of n. (-2)
|
||||||
|
|||||||
Reference in New Issue
Block a user