Commit d190884

committed

added complexity chapter and its content

1 parent 992d701 commit d190884Copy full SHA for d190884

File tree

-4

lines changed

-4

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -141,6 +141,9 @@`
`141`	`141`	`- [Velocity JS](animation-resources/velocityjs.md)`
`142`	`142`	`- [React Spring](animation-resources/react-spring.md)`
`143`	`143`	`- [Framer Motion](animation-resources/framer-motion.md)`
	`144`	`+- [Complexity](complexity/README.md)`
	`145`	`+ - [Space Complexity](complexity/space-complexity.md)`
	`146`	`+ - [Time Complexity](complexity/time-complexity.md)`
`144`	`147`	`- [JavaScript Behind the Scenes](behind-scenes/README.md)`
`145`	`148`	`- [Call Stack](behind-scenes/call-stack.md)`
`146`	`149`	`- [Engine](behind-scenes/engine.md)`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,11 +1,11 @@`
`1`	`1`	`---`
`2`	`2`	`layout: editorial`
`3`		`-chapter: 8`
`4`		`-pageNumber: 53`
	`3`	`+chapter: 27`
	`4`	`+pageNumber: 258`
`5`	`5`	`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.`
`6`	`6`	`---`
`7`	`7`
`8`		`-# Chapter 8`
	`8`	`+# Chapter 27`
`9`	`9`	`# Complexity`
`10`	`10`
`11`	`11`	`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.`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -51,6 +51,6 @@ The code takes n steps to run. Instead of using just plain n for time complexity`
`51`	`51`	`Some common types of Big O notations are as follows:`
`52`	`52`
`53`	`53`	`- O(log n) - logarithmic time complexity`
`54`		`-- O($n^2$) - quadratic time complexity`
	`54`	`+- O(n^2) - quadratic time complexity`
`55`	`55`	`- O(n) - linear time complexity`
`56`	`56`	`- O(1) - constant time complexity`

Comments

(0)