finish another question in assignment 1

1 files changed, 3 insertions, 0 deletions

diff --git a/notes.md b/notes.md
index e8d0064..7e62aae 100644
--- a/notes.md
+++ b/notes.md
@@ -508,3 +508,6 @@ the rate of growth in determining computational efficiency for large inputs.
 2.2-4: How can we modify almost any algorithm to have a good best-case running time?
 
     Reduce the input size by rejecting elements or hard code an early return if some condition is satisfied.
+
+
+## 2.3 Designing Algorithms