Collection of keywords, buzzwords and references
- Time Complexity
-
Space Complexity (pc space consumption)
-
Best-case complexity − When the amount of time required by an algorithm for a given input is minimum.
-
Worst-case complexity − When the amount of time required by an algorithm for a given input is maximum.
-
Average-case complexity − When the amount of time required by an algorithm for a given input is average.
-
Asymptotic Analysis: The complexity or efficiency of an algorithm is the number of steps executed by the algorithm to get the desired output. Asymptotic notation is the easiest way to describe the fastest and slowest possible execution time for an algorithm using high bounds and low bounds on speed. For this, we use the following notations:
-
Big O notation
-
Omega notation
-
Theta notation
-
Speedup of an Algorithm
-
Total Cost
-
Avalanche effect
-
in-place or in-situ, algorithms.
-
asymptotic complexity
-
Abstract data type
-
data abstraction
-
encapsulation
-
information hiding
-
order of magnitude
-
Linear Structures
-
abstract data types stack | queue | deque | list
-
ADTs stack
-
prefix | infix | postfix
-
Algorithmic Thinking
-
Amortized Constant Space Complexity
-
Self Referential Object
-
Contiguous Memory
-
Non-Contiguous Memory
-
Fixed Sized Partition
-
Variable sized Partition
-
internal fragmentation -> Memory wastage inside a partition
-
Most Recently Used (MRU)
-
Asymptotic Analysis
-
fractal vocabulary something that looks the same at all different levels of magnification
-
discrete mathematics
- **proof by induction
- proof by contradiction
-
Pisano periods
-
Traveling Salesman
-
Homogeneous Containers (Only stores 1 data type)
- Heterogeneous Structures (Mix multiple data type)
- Ammortized Constant Space Complexity
-
Bachmann–Landau notation or asymptotic notation.
-
Asymptotic Notations for Analysis of Algorithms (geeksforgeeks)
-
asymptotic growth comparison --> ⪯ vs exact inequality (math) ≤