Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Javascript Time Complexity: Fix Typo #29025

Merged
merged 3 commits into from
Oct 31, 2024
+2 −2
Merged

Javascript Time Complexity: Fix Typo #29025

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
8eaa822
fix: add backtick to currentNumber
looonnng Oct 30, 2024
36f1e2e
fix: add backticks
looonnng Oct 31, 2024
e183156
Merge main to branch
looonnng Oct 31, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion javascript/computer_science/time_complexity.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.

Expand Down
2 changes: 1 addition & 1 deletion ruby/computer_science/time_complexity.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.

Expand Down