Developed by @LeonardoCardoso.
Hash table (also hash map) is a data structure used to implement an associative array, a structure that can map keys to values. Implementally talking, hash table is an array-based data structure, which uses a hash function to compute an index into an array of buckets or slots, from which the correct value can be found. It's designed to keep insertion, deletion and search with O(1) complexity.
This project contains
- Open Hashing (Closed Addressing, Separate Chaining)
- Open Hashing with AVL
- Closed Hashing (Open Addressing)
- Linear probing
- Quadratic probing
- Double hashing
- Rehashing
- Linear probing
- Quadratic probing
- Half Open Hashing
Contact me either by Twitter @leocardz or emailing me to contact@leocardz.com.
Copyright 2015 Leonardo Cardoso
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.