Commit 63fd518

authored

Merge pull request #62 from amejiarosario/hotfix/hashmap

fix(book/maps): update space complexity

2 parents aac8160 + 0be0176 commit 63fd518Copy full SHA for 63fd518

File tree

-2

lines changed

-2

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -52,6 +52,7 @@ include::treemap.asc[]`
`52`	`52`	`As we discussed so far, there is a trade-off between the implementations.`
`53`	`53`	`(((Tables, Non-Linear DS, HashMap/TreeMap complexities)))`
`54`	`54`
	`55`	`+// also on: book/content/part03/time-complexity-graph-data-structures.asc`
`55`	`56`	`// tag::table[]`
`56`	`57`	`.Time complexity for different Maps implementations`
`57`	`58`	`\|===`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
@@ -215,6 +215,7 @@ rehash happens, it will take O(n) instead of O(1). A `TreeSet` is always *O(
`215`	`215`
`216`	`216`	`(((Tables, Non-Linear DS, HashSet/TreeSet complexities)))`
`217`	`217`
	`218`	`+// also on: book/content/part03/time-complexity-graph-data-structures.asc`
`218`	`219`	`// tag::table[]`
`219`	`220`	`.Time complexity HashSet vs TreeSet`
`220`	`221`	`\|===`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,8 +18,8 @@ In this section, we learned about Graphs applications, properties and how we can`
`18`	`18`	`\| Hash Map (naïve) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n)`
`19`	`19`	`\| <<part03-graph-data-structures#hashmap, HashMap>> (optimized) ^\|O(1) ^\|O(n) ^\|O(1)* ^\|O(1) ^\|O(n)`
`20`	`20`	`\| <<part03-graph-data-structures#treemap, TreeMap>> (Red-Black Tree) ^\|O(log n) ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(n)`
`21`		`-\| <<part03-graph-data-structures#hashset, HashSet>> ^\|- ^\|O(n) ^\|O(1)* ^\|O(1)* ^\|O(1)*`
`22`		`-\| <<part03-graph-data-structures#tree-set, TreeSet>> ^\|- ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(log n)`
	`21`	`+\| <<part03-graph-data-structures#hashset, HashSet>> ^\|O(1) ^\|- ^\|O(1)* ^\|O(1) ^\|O(n)`
	`22`	`+\| <<part03-graph-data-structures#tree-set, TreeSet>> ^\|O(log n) ^\|- ^\|O(log n) ^\|O(log n) ^\|O(n)`
`23`	`23`	`\|===`
`24`	`24`	`{empty}* = Amortized run time. E.g. rehashing might affect run time to O(n).`
`25`	`25`	`// end::table[]`

Comments

(0)