From 6a40ed1e22b9368f64193f8f5b87a04c85d0d73e Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Thu, 19 Oct 2023 23:20:30 -0400 Subject: [PATCH] lecture 12 not 13 --- hws/06_inverse_word_search/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/hws/06_inverse_word_search/README.md b/hws/06_inverse_word_search/README.md index 2bb71bc..95c6555 100644 --- a/hws/06_inverse_word_search/README.md +++ b/hws/06_inverse_word_search/README.md @@ -2,7 +2,7 @@ In this homework we will build an inverse word search program using the techniques of recursion. The goal is to construct a grid of letters that one can search to find specific words. Understanding the non-linear word -search program from Lectures 12 & 13 will be helpful in thinking about how you will solve this problem. +search program from Lectures 12 will be helpful in thinking about how you will solve this problem. We strongly urge you to study and play with that program, including tracing through its behavior using a debugger or cout statements or both. Please read the entire handout before beginning your implementation.