Explore >> Select a destination
|
You are here 
|
lazarusoverlook.com | ||
| | | | |
benhoyt.com
|
|
| | | | | An explanation of how to implement a simple hash table data structure, with code and examples in the C programming language. | |
| | | | |
tessil.github.io
|
|
| | | | | ||
| | | | |
emre.me
|
|
| | | | | A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing associative arrays1 (maps, dictionaries). | |
| | | | |
www.sjoerdlangkemper.nl
|
|
| | | To securely store passwords they should be hashed with a slow hashing function, such as PBKDF2. PBKDF2 is slow because it calls a fast hash function many times. This blog post explores some properties that the iterations must have to be secure. | ||
