Commit 3c4ef75

committed

fix(book/maps): update time/space complexity values

1 parent 7284619 commit 3c4ef75Copy full SHA for 3c4ef75

File tree

-4

lines changed

-4

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -58,8 +58,8 @@ As we discussed so far, there is a trade-off between the implementations.`
`58`	`58`	`.2+.^s\| Data Structure 2+^s\| Searching By .2+^.^s\| Insert .2+^.^s\| Delete .2+^.^s\| Space Complexity`
`59`	`59`	`^\|_Index/Key_ ^\|_Value_`
`60`	`60`	`\| Hash Map (naïve) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n)`
`61`		`-\| Hash Map (optimized) ^\|O(1)* ^\|O(n) ^\|O(1)* ^\|O(1)* ^\|O(1)*`
`62`		`-\| Tree Map (Red-Black Tree) ^\|O(log n) ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(log n)`
	`61`	`+\| Hash Map (optimized) ^\|O(1) ^\|O(n) ^\|O(1)* ^\|O(1) ^\|O(n)`
	`62`	`+\| Tree Map (Red-Black Tree) ^\|O(log n) ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(n)`
`63`	`63`	`\|===`
`64`	`64`	`{empty}* = Amortized run time. E.g. rehashing might affect run time to O(n).`
`65`	`65`	`// end::table[]`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,8 +16,8 @@ In this section, we learned about Graphs applications, properties and how we can`
`16`	`16`	`\| <<part03-graph-data-structures#bst, BST (unbalanced)>> ^\|- ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n)`
`17`	`17`	`\| <<b-self-balancing-binary-search-trees#, BST (balanced)>> ^\|- ^\|O(log n) ^\|O(log n) ^\|O(log n) ^\|O(n)`
`18`	`18`	`\| Hash Map (naïve) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n)`
`19`		`-\| <<part03-graph-data-structures#hashmap, HashMap>> (optimized) ^\|O(1)* ^\|O(n) ^\|O(1)* ^\|O(1)* ^\|O(1)*`
`20`		`-\| <<part03-graph-data-structures#treemap, TreeMap>> (Red-Black Tree) ^\|O(log n) ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(log n)`
	`19`	`+\| <<part03-graph-data-structures#hashmap, HashMap>> (optimized) ^\|O(1) ^\|O(n) ^\|O(1)* ^\|O(1) ^\|O(n)`
	`20`	`+\| <<part03-graph-data-structures#treemap, TreeMap>> (Red-Black Tree) ^\|O(log n) ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(n)`
`21`	`21`	`\| <<part03-graph-data-structures#hashset, HashSet>> ^\|- ^\|O(n) ^\|O(1)* ^\|O(1)* ^\|O(1)*`
`22`	`22`	`\| <<part03-graph-data-structures#tree-set, TreeSet>> ^\|- ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(log n)`
`23`	`23`	`\|===`

Comments

(0)