Translation needed for existing languages

Open
#252 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Documentation
Clarity
Needs clarification
Activity status
Stale
Tech stack
javascript, markdown
Domain
documentation, internationalization, localization

Research direction

Review PR #251 and the English files it changes: en/SUMMARY.md, en/complexity/README.md, and en/complexity/time-complexity.md. Compare these additions with the repository's existing language directories to determine which translations are needed. Done means the complexity chapter is translated for the identified languages and their navigation matches the English version.

Written by the indexing model from the issue text.

Description

translate help-wanted

@sumn2u has made changes on the original english version of the book (PR #251)

Visual Diff of Changes:

diff --git a/en/SUMMARY.md b/en/SUMMARY.md
index a3c47a9..87df426 100644
--- a/en/SUMMARY.md
+++ b/en/SUMMARY.md
@@ -141,6 +141,9 @@
   - [Velocity JS](animation-resources/velocityjs.md)
   - [React Spring](animation-resources/react-spring.md)
   - [Framer Motion](animation-resources/framer-motion.md)
+- [Complexity](complexity/README.md)
+  - [Space Complexity](complexity/space-complexity.md)
+  - [Time Complexity](complexity/time-complexity.md)
 - [JavaScript Behind the Scenes](behind-scenes/README.md)
   - [Call Stack](behind-scenes/call-stack.md)
   - [Engine](behind-scenes/engine.md)
diff --git a/en/complexity/README.md b/en/complexity/README.md
index e46b9b8..468a478 100644
--- a/en/complexity/README.md
+++ b/en/complexity/README.md
@@ -1,11 +1,11 @@
 ---
 layout: editorial
-chapter: 8
-pageNumber: 53
+chapter: 27
+pageNumber: 258
 description: Analyzing an algorithm's efiiciency is most important part of writing an optimal program. This chapter deep dives into analayzing the efficiency by understanding the space and time complexity.
 ---
 
-# Chapter 8
+# Chapter 27
 # Complexity
 
 From previous chapter you should have understood how to create an algorithm. In this chapter, we will explore the intricacies of algorithmic complexity in JavaScript.
diff --git a/en/complexity/time-complexity.md b/en/complexity/time-complexity.md
index 13c4c07..0d8cbe2 100644
--- a/en/complexity/time-complexity.md
+++ b/en/complexity/time-complexity.md
@@ -51,6 +51,6 @@ The code takes n steps to run. Instead of using just plain n for time complexity
 Some common types of Big O notations are as follows:
 
 - O(log n) - logarithmic time complexity
-- O($n^2$) - quadratic time complexity
+- O(n^2) - quadratic time complexity
 - O(n) - linear time complexity
 - O(1) - constant time complexity
Dominant language
HTML
Stars
1k
Forks
187
Avg merge
5d 5h
Merged PRs (30d)
1

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from sumn2u/learn-javascript

All issues in sumn2u/learn-javascript

Similar issues

More Documentation issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.