Theory and Implementation of Data Structures and Algorithms using Python
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.
Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type.
- Arrays
- Matrix
- Lists
- Tuples
- Sets
- Maps
- Linked List
- Stacks
- Queues
- Hash tables
- Binary Trees
- Binary Search Trees
- Heaps
- Graphs
Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.
- Divide and Conquer
- Recursion
- Backtracking
- Tree Traversal
- Sorting
- Searching
- Graphs
- Algorithm Analysis
- Big-O Notation
- Algorithm classes