diff --git a/labs/smart_memory/README.md b/labs/smart_memory/README.md
index 61e2fce..fe5bdc8 100644
--- a/labs/smart_memory/README.md
+++ b/labs/smart_memory/README.md
@@ -1,7 +1,7 @@
 # Lab 12 — Heap Sort & Smart Pointers
 <!-- # Lab 14 — Garbage Collection & Smart Pointers -->
 
-## Checkpoint 0
+## Checkpoint 0:
 
 If you haven’t done so already, please complete your course evaluation for Data Structures (your honest & anonymous feedback is very important!). Have the webpage receipt saying "completed" open in your browser to receive credit for Checkpoint 0.
 
@@ -81,4 +81,3 @@ find std::set helpful. Once you have identified all of the nodes that are access
 you can call delete on each Node. Write additional test cases to confirm that your code is debugged.
 
 **To complete this checkpoint**: Show the TA cyclic memory diagram, your debugged implementation, and the memory debugger output to confirm that your code has no memory errors or leaks.
--->