User:David Eppstein/Fundamental Data Structures
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Fundamental Data Structures
- Introduction
- Abstract data type
- Data structure
- Analysis of algorithms
- Amortized analysis
- Accounting method
- Potential method
- Sequences
- Array data type
- Array data structure
- Dynamic array
- Linked list
- Doubly linked list
- Stack (abstract data type)
- Queue (abstract data type)
- Double-ended queue
- Circular buffer
- Dictionaries
- Associative array
- Association list
- Hash table
- Linear probing
- Quadratic probing
- Double hashing
- Cuckoo hashing
- Hopscotch hashing
- Hash function
- Perfect hash function
- Universal hashing
- K-independent hashing
- Tabulation hashing
- Cryptographic hash function
- Sets
- Set (abstract data type)
- Bit array
- Bloom filter
- MinHash
- Disjoint-set data structure
- Partition refinement
- Priority queues
- Priority queue
- Heap (data structure)
- Binary heap
- d-ary heap
- Binomial heap
- Fibonacci heap
- Pairing heap
- Soft heap
- Successors and neighbors
- Integer and string searching