Algorithms: Difference between revisions
Jump to navigation
Jump to search
| Line 18: | Line 18: | ||
=Organizatorium= | =Organizatorium= | ||
* [[Array]] | |||
* [[Directed Acyclic Graph]] | |||
* [[Associative Array]] | |||
* [[Map]] | |||
* [[Tree]] | |||
** [[Red-black Tree|Red-Black Tree]] | |||
* 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 | ||
Revision as of 02:41, 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.