From 89330bf573ac16b6296516006a77abed11357c14 Mon Sep 17 00:00:00 2001 From: Ryan Russell Date: Mon, 30 May 2022 08:22:10 -0500 Subject: [PATCH] Improve readability Signed-off-by: Ryan Russell --- .../uncategorized/best-time-to-buy-sell-stocks/README.md | 2 +- src/data-structures/bloom-filter/README.md | 2 +- src/data-structures/tree/binary-search-tree/README.md | 2 +- src/data-structures/tree/binary-search-tree/README.pt-BR.md | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/src/algorithms/uncategorized/best-time-to-buy-sell-stocks/README.md b/src/algorithms/uncategorized/best-time-to-buy-sell-stocks/README.md index 9446993e..975eade3 100644 --- a/src/algorithms/uncategorized/best-time-to-buy-sell-stocks/README.md +++ b/src/algorithms/uncategorized/best-time-to-buy-sell-stocks/README.md @@ -46,7 +46,7 @@ Let's say we have an array of prices `[7, 6, 4, 3, 1]` and we're on the _1st_ da 1. _Option 1: Keep the money_ → profit would equal to the profit from buying/selling the rest of the stocks → `keepProfit = profit([6, 4, 3, 1])`. 2. _Option 2: Buy/sell at current price_ → profit in this case would equal to the profit from buying/selling the rest of the stocks plus (or minus, depending on whether we're selling or buying) the current stock price → `buySellProfit = -7 + profit([6, 4, 3, 1])`. -The overall profit would be equal to → `overalProfit = Max(keepProfit, buySellProfit)`. +The overall profit would be equal to → `overallProfit = Max(keepProfit, buySellProfit)`. As you can see the `profit([6, 4, 3, 1])` task is being solved in the same recursive manner. diff --git a/src/data-structures/bloom-filter/README.md b/src/data-structures/bloom-filter/README.md index 17c66677..a85e793a 100644 --- a/src/data-structures/bloom-filter/README.md +++ b/src/data-structures/bloom-filter/README.md @@ -92,7 +92,7 @@ three factors: the size of the bloom filter, the number of hash functions we use, and the number of items that have been inserted into the filter. -The formula to calculate probablity of a false positive is: +The formula to calculate probability of a false positive is: ( 1 - e -kn/m ) k diff --git a/src/data-structures/tree/binary-search-tree/README.md b/src/data-structures/tree/binary-search-tree/README.md index f3e448a9..46d4a809 100644 --- a/src/data-structures/tree/binary-search-tree/README.md +++ b/src/data-structures/tree/binary-search-tree/README.md @@ -143,7 +143,7 @@ end remove findParent(value, root) Pre: value is the value of the node we want to find the parent of root is the root node of the BST and is != ø - Post: a reference to the prent node of value if found; otherwise ø + Post: a reference to the parent node of value if found; otherwise ø if value = root.value return ø end if diff --git a/src/data-structures/tree/binary-search-tree/README.pt-BR.md b/src/data-structures/tree/binary-search-tree/README.pt-BR.md index 4565538a..e007113f 100644 --- a/src/data-structures/tree/binary-search-tree/README.pt-BR.md +++ b/src/data-structures/tree/binary-search-tree/README.pt-BR.md @@ -142,7 +142,7 @@ end remove findParent(value, root) Pre: value is the value of the node we want to find the parent of root is the root node of the BST and is != ø - Post: a reference to the prent node of value if found; otherwise ø + Post: a reference to the parent node of value if found; otherwise ø if value = root.value return ø end if