From 9d1335bc181e569c837fde28f4a6dd9f34cce28f Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Tue, 1 Apr 2025 17:57:01 -0400
Subject: [PATCH] renaming

---
 labs/hash_tables/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/labs/hash_tables/README.md b/labs/hash_tables/README.md
index aee8943..7f9ec7b 100644
--- a/labs/hash_tables/README.md
+++ b/labs/hash_tables/README.md
@@ -1,4 +1,4 @@
-# Lab 12 — Hash Tables
+# Lab 9 — Hash Tables
 
 <!--In this lab, you will first experiment with our hash table implementation of a set. The key differences between the ds_set class (based on a binary search tree) and the ds_hashset class (based on a hash table, of course), are the performance of insert/find/erase: O(log n) vs. O(1), and the order that the elements are traversed using iterators: the set was in order, while the hashset is in no apparent order.-->