Commit 0319b29

committed

fix(book/hashset): update hashset space complexity

1 parent 3c4ef75 commit 0319b29Copy full SHA for 0319b29

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
@@ -220,8 +220,8 @@ rehash happens, it will take O(n) instead of O(1). A `TreeSet` is always *O(
`220`	`220`	`\|===`
`221`	`221`	`.2+.^s\| Data Structure 2+^s\| Searching By .2+^.^s\| Insert .2+^.^s\| Delete .2+^.^s\| Space Complexity`
`222`	`222`	`^\|_Index/Key_ ^\|_Value_`
`223`		`-\| HashSet ^\|- ^\|O(n) ^\|O(1)* ^\|O(1)* ^\|O(1)*`
`224`		`-\| TreeSet ^\|- ^\|O(n) ^\|O(log n) ^\|O(log n) ^\|O(log n)`
	`223`	`+\| HashSet ^\|O(1) ^\|- ^\|O(1)* ^\|O(1) ^\|O(n)`
	`224`	`+\| TreeSet ^\|O(log n) ^\|- ^\|O(log n) ^\|O(log n) ^\|O(n)`
`225`	`225`	`\|===`
`226`	`226`	`{empty}* = Amortized run time. E.g. rehashing might affect run time to O(n).`
`227`	`227`	`// end::table[]`

Comments

(0)