From 0be0176efc121c5608c1a2df25280d6d9c08e6f3 Mon Sep 17 00:00:00 2001 From: Adrian Mejia Date: Sun, 24 May 2020 09:02:32 -0400 Subject: [PATCH 1/2] fix(book/maps): update space complexity --- book/content/part03/map.asc | 1 + book/content/part03/set.asc | 1 + book/content/part03/time-complexity-graph-data-structures.asc | 4 ++-- 3 files changed, 4 insertions(+), 2 deletions(-) diff --git a/book/content/part03/map.asc b/book/content/part03/map.asc index b32802fb..11106d4f 100644 --- a/book/content/part03/map.asc +++ b/book/content/part03/map.asc @@ -52,6 +52,7 @@ include::treemap.asc[] As we discussed so far, there is a trade-off between the implementations. (((Tables, Non-Linear DS, HashMap/TreeMap complexities))) +// also on: book/content/part03/time-complexity-graph-data-structures.asc // tag::table[] .Time complexity for different Maps implementations |=== diff --git a/book/content/part03/set.asc b/book/content/part03/set.asc index cbe6fe60..4f02fa61 100644 --- a/book/content/part03/set.asc +++ b/book/content/part03/set.asc @@ -215,6 +215,7 @@ rehash happens, it will take *O(n)* instead of *O(1)*. A `TreeSet` is always *O( (((Tables, Non-Linear DS, HashSet/TreeSet complexities))) +// also on: book/content/part03/time-complexity-graph-data-structures.asc // tag::table[] .Time complexity HashSet vs TreeSet |=== diff --git a/book/content/part03/time-complexity-graph-data-structures.asc b/book/content/part03/time-complexity-graph-data-structures.asc index 620171ed..a62d68c4 100644 --- a/book/content/part03/time-complexity-graph-data-structures.asc +++ b/book/content/part03/time-complexity-graph-data-structures.asc @@ -18,8 +18,8 @@ In this section, we learned about Graphs applications, properties and how we can | Hash Map (naïve) ^|O(n) ^|O(n) ^|O(n) ^|O(n) ^|O(n) | <> (optimized) ^|O(1) ^|O(n) ^|O(1)* ^|O(1) ^|O(n) | <> (Red-Black Tree) ^|O(log n) ^|O(n) ^|O(log n) ^|O(log n) ^|O(n) -| <> ^|- ^|O(n) ^|O(1)* ^|O(1)* ^|O(1)* -| <> ^|- ^|O(n) ^|O(log n) ^|O(log n) ^|O(log n) +| <> ^|O(1) ^|- ^|O(1)* ^|O(1) ^|O(n) +| <> ^|O(log n) ^|- ^|O(log n) ^|O(log n) ^|O(n) |=== {empty}* = Amortized run time. E.g. rehashing might affect run time to *O(n)*. // end::table[] From f484075b58a2c4109f97a0faa9aeb3090df7727d Mon Sep 17 00:00:00 2001 From: semantic-release-bot Date: Sun, 24 May 2020 16:48:50 +0000 Subject: [PATCH 2/2] :bookmark: chore(release): 1.8.3 ## [1.8.3](https://github.com/amejiarosario/dsa.js/compare/1.8.2...1.8.3) (2020-05-24) ### Bug Fixes * **book/maps:** update space complexity ([0be0176](https://github.com/amejiarosario/dsa.js/commit/0be0176efc121c5608c1a2df25280d6d9c08e6f3)) --- CHANGELOG.md | 7 +++++++ package-lock.json | 2 +- package.json | 2 +- 3 files changed, 9 insertions(+), 2 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 0a985824..09ba1001 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,3 +1,10 @@ +## [1.8.3](https://github.com/amejiarosario/dsa.js/compare/1.8.2...1.8.3) (2020-05-24) + + +### Bug Fixes + +* **book/maps:** update space complexity ([0be0176](https://github.com/amejiarosario/dsa.js/commit/0be0176efc121c5608c1a2df25280d6d9c08e6f3)) + ## [1.8.2](https://github.com/amejiarosario/dsa.js/compare/1.8.1...1.8.2) (2020-05-24) diff --git a/package-lock.json b/package-lock.json index 5b6157d7..734ae1f2 100644 --- a/package-lock.json +++ b/package-lock.json @@ -1,6 +1,6 @@ { "name": "dsa.js", - "version": "1.8.2", + "version": "1.8.3", "lockfileVersion": 1, "requires": true, "dependencies": { diff --git a/package.json b/package.json index c1251ebb..f27525a6 100644 --- a/package.json +++ b/package.json @@ -1,6 +1,6 @@ { "name": "dsa.js", - "version": "1.8.2", + "version": "1.8.3", "description": "Data Structures & Algorithms in JS", "author": "Adrian Mejia (https://adrianmejia.com)", "homepage": "https://github.com/amejiarosario/dsa.js",