From 7eb51a88dadfefd36f2abeaedce53e7b3e6cc76e Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Tue, 19 Sep 2023 23:26:52 -0400
Subject: [PATCH] adding indent

---
 lectures/07_order_notation_recursion/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lectures/07_order_notation_recursion/README.md b/lectures/07_order_notation_recursion/README.md
index f33dcd6..c202b5b 100644
--- a/lectures/07_order_notation_recursion/README.md
+++ b/lectures/07_order_notation_recursion/README.md
@@ -24,7 +24,7 @@ operations, and then multiply this count by the average cost of an operation.
 ```cpp
 double sum = 0;
 for (int i=0; i<n; ++i)
-sum += arr[i];
+    sum += arr[i];
 ```
 - What is the total number of operations performed in executing this fragment? Come up with a function describing the number of operations in terms of n.