From bd7fc9d53fa61a0daaecfb379499b8f78f02b174 Mon Sep 17 00:00:00 2001 From: mo khan Date: Sat, 26 Sep 2020 20:02:34 -0600 Subject: docs: small formatting updates --- src/03/README.md | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/src/03/README.md b/src/03/README.md index cb39842..7ecce3b 100644 --- a/src/03/README.md +++ b/src/03/README.md @@ -1,7 +1,8 @@ -# Learning Profile for Assignment #3 - Computer Science 272: Data Structures and Algorithms +# Learning Profile for Assignment #3 +## Computer Science 272: Data Structures and Algorithms -Name: Mo Khan -Student ID: 3431709 +* Name: Mo Khan +* Student ID: 3431709 ## Question 1 ### Problem Statement @@ -991,7 +992,7 @@ Suppose we have a function `h` that takes input `k` and returns a tree with `k` leaves. For each positive natural number we can -assert that the height of the tree must greater +assert that the height of the tree must be greater than or equal to `log2(k)`. ```plaintext -- cgit v1.2.3