This project compares the performance of linked list and hash table for the same input in terms of speed. While hash table's search operation costs O(1), linked list's search operation cost is O(n). So, you can easily observe their run times using large and intense inputs. Please, read the report clearly before using the code.
This repository was archived by the owner on Oct 3, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Compare the performance of linked list and hash table in terms of speed.
License
0x01h/hashtable-vs-linkedlist
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Compare the performance of linked list and hash table in terms of speed.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published