From 8eaa82291a0a3633ba3cf2d2a2b42e2964126d0c Mon Sep 17 00:00:00 2001 From: T14s <122837733+looonnng@users.noreply.github.com> Date: Tue, 29 Oct 2024 22:12:29 -0500 Subject: [PATCH 1/2] fix: add backtick to currentNumber --- javascript/computer_science/time_complexity.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/javascript/computer_science/time_complexity.md b/javascript/computer_science/time_complexity.md index b5579630123..b2cdb897e39 100644 --- a/javascript/computer_science/time_complexity.md +++ b/javascript/computer_science/time_complexity.md @@ -51,7 +51,7 @@ Let's go back to our `oddNumbersLessThanTen function`. How many steps does our a 1. We have a loop. For each iteration of the loop, we do the following: 1. Compare `currentNumber` to see if it is less than 10. That is 1 step. - 1. We then check if currentNumber is odd. That is 1 step. + 1. We then check if `currentNumber` is odd. That is 1 step. 1. If it is then we output it to the terminal. That's 1 step every 2 iterations. 1. We increase `currentNumber` by 1. That is 1 step. From 36f1e2e2038bfd7ebcee2f08ae73e2e8211debd0 Mon Sep 17 00:00:00 2001 From: T14s <122837733+looonnng@users.noreply.github.com> Date: Wed, 30 Oct 2024 22:38:01 -0500 Subject: [PATCH 2/2] fix: add backticks --- ruby/computer_science/time_complexity.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ruby/computer_science/time_complexity.md b/ruby/computer_science/time_complexity.md index b5e789248ae..691fc08dd35 100644 --- a/ruby/computer_science/time_complexity.md +++ b/ruby/computer_science/time_complexity.md @@ -51,7 +51,7 @@ Let's go back to our `odd_numbers_less_than_ten method`. How many steps does our 1. We have a loop. For each iteration of the loop, we do the following: 1. Compare `current_number` to see if it is less than 10. That is 1 step. - 1. We then check if current_number is odd. That is 1 step. + 1. We then check if `current_number` is odd. That is 1 step. 1. If it is then we output it to the terminal. That's 1 step every 2 iterations. 1. We increase `current_number` by 1. That is 1 step.