User:Realazthat/Notes/Containers: Difference between revisions
< User:Realazthat | Notes
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 16: | Line 16: | ||
** Adjacency matrix with O(n + m) init time, O(n^2) space, and O(1) lookup time |
** Adjacency matrix with O(n + m) init time, O(n^2) space, and O(1) lookup time |
||
**: http://garryowen.csis.ul.ie/~cs4115/resources/oth7.pdf |
**: http://garryowen.csis.ul.ie/~cs4115/resources/oth7.pdf |
||
** "Develop a technique to initialize an entry of a matrix to zero the first time it is accessed, thereby eliminating the O( |
** "Develop a technique to initialize an entry of a matrix to zero the first time it is accessed, thereby eliminating the O(|V|^2) time to initialize an adjacency matrix." |
||
**: http://research.swtch.com/2008/03/using-uninitialized-memory-for-fun-and.html |
**: http://research.swtch.com/2008/03/using-uninitialized-memory-for-fun-and.html |
||
Revision as of 20:11, 21 January 2011
- Tries
- Hash tables
- khash
- google dense_hash_set
- gnu hash_set
- STDXXL
- STL Containers for huge amounts of data, uses disk as storage
- Reversible Linked List
- Other
- Graph
- Adjacency matrix with O(n + m) init time, O(n^2) space, and O(1) lookup time
- "Develop a technique to initialize an entry of a matrix to zero the first time it is accessed, thereby eliminating the O(|V|^2) time to initialize an adjacency matrix."