Skip to main content

Table 2 Fastest data structure according to our estimation for different list sizes

From: Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis

o v      e     
  101 102 103 104 105 101 102 103 104 105
init LL LL LL LL LL LL LL LL LL LL
a d d s AL HS HAL HAL HS AL AL HS HT HT
a d d f A A A HS A A HS HS HS HS
r e m s A A A A A A A HS HM HM
r e m f A A A A A AL HS HS HS HM
g e t s A LL A A LL A HAL LL HM HT
g e t f A A A A A A HAL LL HM HM
iter AL HAL HAL HAL LL AL HAL LL LL A
rand A HAL A A A AL HAL A A HAL
size A LL A A A A A A A HAL
c o n t s A A A A LL A HS HS HAL HS
c o n t f A A A A HS A HS LL HM HS
  1. A Array, AL ArrayList, HAL HashArrayList HM HashMap, HS HashSet, HT HashTable, LL LinkedList