Algorithms: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
=External= | =External= | ||
=Internal= | =Internal= | ||
| Line 11: | Line 9: | ||
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. | 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. | ||
=Organizatorium= | =Organizatorium= | ||
| Line 26: | Line 27: | ||
* https://en.wikipedia.org/wiki/Big_O_notation | * 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 | * 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 | |||
Revision as of 02:42, 3 August 2018
External
Internal
Overview
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.
Organizatorium
- 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