README
¶
Data Structures and Algorithms
Data Structures
In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data.
- Array
- Linked List
- Queue
- Stack
- Hash Table
- Disjoint Set
- Binary Heap
- Binary Search Tree
- Bloom Filter
- Radix Tree
- Prefix Tree
- R-Tree
- 2d-Tree
Algorithms
In mathematics and computer science, an algorithm is a finite sequence of well-defined instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations, data processing, automated reasoning, automated decision-making and other tasks. In contrast, a heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result.
Directories