From 50111f1429b7ca0421bdc76aded3171cbfda0adc Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Tue, 7 Nov 2023 02:19:51 -0500 Subject: [PATCH] about the extra credits --- labs/11_hash_tables/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/labs/11_hash_tables/README.md b/labs/11_hash_tables/README.md index 9954828..a20571d 100644 --- a/labs/11_hash_tables/README.md +++ b/labs/11_hash_tables/README.md @@ -60,7 +60,7 @@ Complete the *isHappy* function using separate chaining. Do not use any of these **To complete this checkpoint**: Show a TA these additions and the test output. -## Checkpoint 3: Separate Chaining Hash Table +## Checkpoint 3,4,5,6: Separate Chaining Hash Table (Yes, it's Checkpoint 3,4,5,6, as there are 3 extra credits for make this program work.) *estimate: 30-40 minutes* @@ -84,6 +84,6 @@ Output: 9 Explanation: The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6, 7, 8]. Therefore its length is 9. ``` -**To complete this checkpoint**: Show a TA your program and the test results. +**To complete checkpoint (3,4,5,6)**: Show a TA your program and the test results. -**Note**: checkpoint 3 is very challenging, if you can't get it work during your lab period, make sure you understand it completely after the lab period, because one of the four problems on Test 3, will be about separate-chaining-based hash tables. It's 100% certain. +**Note**: checkpoint (3,4,5,6) is very challenging, if you can't get it work during your lab period, make sure you understand it completely after the lab period, because one of the four problems on Test 3, will be about separate-chaining-based hash tables. It's 100% certain.