Skip to content

Comparison between different associative array data structures.

Notifications You must be signed in to change notification settings

atalantus/associative-array-comparison

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 

Repository files navigation

Associative Array Comparison

An associative array, map, symbol table or dictionary is a data structure storing a collection of key-value pairs with the key being unique.

This project aims to compare different such data structures based on their optimized C/C++ implementations.

Supported Data Structures

Trees

  • Binary Tree

Search Trees

  • Binary Search Tree
  • Red-Black Tree
  • Splay Tree

Tries

  • Array Trie
  • Linked-List Trie

Radix Trees

  • Judy Array
  • Adaptive Radix Tree

Hash Tables

Chained Hash Tables

Cuckoo Hashing

Other

  • Sorted List
  • Skip List

Operations Supported

Category Type Data Structure Insert Delete Lookup Range-Lookup
Tree Binary Tree

About

Comparison between different associative array data structures.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published