diff --git a/javascript/computer_science/time_complexity.md b/javascript/computer_science/time_complexity.md
index b557963012..b2cdb897e3 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.
 
diff --git a/ruby/computer_science/time_complexity.md b/ruby/computer_science/time_complexity.md
index b5e789248a..691fc08dd3 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.