Algorithms: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
Line 7: | Line 7: | ||
=Overview= | =Overview= | ||
* Arrays. | |||
* Lists (single linked and double linked) | |||
* Stack | |||
* Queue | |||
* Sorting | |||
** Comparison Sort | |||
** Non-comparison Sort | |||
* Algorithm complexity | |||
* Set | |||
* Map | |||
* Hash Map | |||
* Distributed Hash Map | |||
* Trees | |||
** Binary Trees | |||
*** Sorting trees. | |||
** BTrees | |||
* Graphs | |||
* Graph algorithms | |||
=Organizatorium= | =Organizatorium= |
Revision as of 00:19, 4 August 2018
External
Internal
Overview
- Arrays.
- Lists (single linked and double linked)
- Stack
- Queue
- Sorting
- Comparison Sort
- Non-comparison Sort
- Algorithm complexity
- Set
- Map
- Hash Map
- Distributed Hash Map
- Trees
- Binary Trees
- Sorting trees.
- BTrees
- Binary Trees
- Graphs
- Graph algorithms
Organizatorium
- A data structure is an arrangement of data in computer's memory or external storage. Data structures include arrays, linked lists, stacks, binary trees, hash tables, etc. Algorithms manipulate the data in these structures in various ways.
- Array
- Directed Acyclic Graph
- Associative Array
- Map
- Tree
- Consistent Hashing
- https://en.wikipedia.org/wiki/Big_O_notation
- https://probablydance.com/2018/06/16/fibonacci-hashing-the-optimization-that-the-world-forgot-or-a-better-alternative-to-integer-modulo
- http://infotechgems.blogspot.com/2011/11/java-collections-performance-time.html