|
|
Practical Efficiency of Containers
Halámka, Jan ; Letko, Zdeněk (referee) ; Holík, Lukáš (advisor)
This thesis is about theorethical and practical comparrison of following data containers: vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.
|
|
|
Practical Efficiency of Containers
Halámka, Jan ; Letko, Zdeněk (referee) ; Holík, Lukáš (advisor)
This thesis is about theorethical and practical comparrison of following data containers: vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.
|
guest ::
