June 2020
Intermediate to advanced
382 pages
11h 39m
English
Content preview from 40 Algorithms Every Programmer Should Know
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Time complexity analysis for sets
Following is the time complexity analysis for sets:
| Sets | Complexity |
| Add an element | O(1) |
| Remove an element | O(1) |
| Copy | O(n) |
An important thing to note from the complexity analysis of the sets is that the time taken to add an element is totally independent of the size of a particular set.