From 7515851e37f7476efa71d8552e6872276ddf4ba8 Mon Sep 17 00:00:00 2001
From: mo khan <mo@mokhan.ca>
Date: Sun, 7 Nov 2021 16:40:19 -0700
Subject: fix alignment

---
 0x01/README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to '0x01')

diff --git a/0x01/README.md b/0x01/README.md
index 47bc84b..e0a0016 100644
--- a/0x01/README.md
+++ b/0x01/README.md
@@ -379,8 +379,8 @@ properties.
 1. Exercise 4.4-7 from the textbook (10 marks)
 
   Draw the recursion tree for `T(n) = 4T([n/2]) + cn`, where `c` is a constant,
-  and provide a tight asymptotic bound on its solution. Verify your bound by the
-  substitution method.
+  and provide a tight asymptotic bound on its solution.
+  Verify your bound by the substitution method.
 
   `T(n) = 4T(n/2) + cn`
 
-- 
cgit v1.2.3