From 3d5614564f34628738aeb0cb86f980bda3bfbbb9 Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Sat, 8 Mar 2025 17:07:47 -0500
Subject: [PATCH] doesn't have to be nested

---
 hws/inverse_word_search/README.md | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/hws/inverse_word_search/README.md b/hws/inverse_word_search/README.md
index 4aabfa3..abd860b 100644
--- a/hws/inverse_word_search/README.md
+++ b/hws/inverse_word_search/README.md
@@ -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)
    - Two or more of name, collaborators, or hours not filled in. (-2)
    - No reflection. (-1)
- - LETTER GRID REPRESENTATION (3 pts)
+<!-- - LETTER GRID REPRESENTATION (3 pts)
    - Grid is not represented via nested structure vector&lt;vector&lt;char&gt;&gt;, vector&lt;vector&lt;string&gt;&gt;, vector&lt;string&gt;, char\*\*, etc. (-2)
    - Lookup of a position is not O(1), uses something like&lt;list&lt;char&gt;&gt; which has lookup of O(n). (-1)
    - 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)
-   - Uses recursion but only trivially. (-5)
-   - Does not use any recursion. (-7)
+   - Uses recursion but only trivially. (-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)
    - 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)